In　this　work,　we　investigate　online　bicriteria　algorithms　that　consider　both　coverage　and　cost　in　the　team　formation　problem,　which　selects　a　set　of　experts　with　the　objective　of　maximizing　the　difference　of　two　set　functions　f−,　where　function　f　is　non-negative　normalized　monotone　approximately　submodular,　and　function　is　non-negative　linear.　By　exploiting　the　problem＇s　combinatorial　structure,　we　present　three　bicriteria　algorithms　along　with　their　corresponding　competitive　analysis.　The　first　two　algorithms　handle　the　cases　where　function　f　is　γ-weakly　submodular,　and　strictly　γ-weakly　submodular,　respectively.　The　last　algorithm　is　more　general　by　integrating　the　first　two　with　extra　parameters　introduced.　©　2020　Elsevier　B.V.