In　this　paper,　we　investigate　the　team　formation　problem　to　balance　the　coverage　gained　and　the　cost　incurred.　This　problem　can　be　formulated　as　maximizing　the　difference　of　two　set　functions　(Formula　Presented),　where　f　is　non-negative　monotone　approximately　submodular　function,　and　l　is　non-negative　linear　function.　We　propose　three　online　bicriteria　algorithms.　The　first　two　handle　the　cases　where　the　function　f　is　(Formula　Presented)-weakly　submodular,　and　strictly　(Formula　Presented)-weakly　submodular,　respectively.　The　last　algorithm　integrates　the　first　two　with　more　parameters　introduced.　©　2020,　Springer　Nature　Switzerland　AG.