{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T02:33:38Z","timestamp":1774406018398,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871081"],"award-info":[{"award-number":["11871081"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871081"],"award-info":[{"award-number":["11871081"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Natural Science Foundation Project","award":["Z200002"],"award-info":[{"award-number":["Z200002"]}]},{"name":"Beijing Natural Science Foundation Project","award":["Z200002"],"award-info":[{"award-number":["Z200002"]}]},{"name":"National Natural Sciences and Engineering Research Council of Canada","award":["06446"],"award-info":[{"award-number":["06446"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771386"],"award-info":[{"award-number":["11771386"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11728104"],"award-info":[{"award-number":["11728104"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801251"],"award-info":[{"award-number":["11801251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10878-021-00827-w","type":"journal-article","created":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T17:00:58Z","timestamp":1635872458000},"page":"2946-2962","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Bicriteria streaming algorithms to balance gain and cost with cardinality constraint"],"prefix":"10.1007","volume":"44","author":[{"given":"Yijing","family":"Wang","sequence":"first","affiliation":[]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0842-8533","authenticated-orcid":false,"given":"Yanjun","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,2]]},"reference":[{"key":"827_CR1","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos A, Becchetti L, Castillo C, Gionis A, Leonardi S (2012) Online team formation in social networks. In: Proceedings of the 21st international conference on world wide web, pp 839\u2013848","DOI":"10.1145\/2187836.2187950"},{"key":"827_CR2","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos A, Castillo C, Fazzone A, Leonardi S, Terzi E (2018) Algorithms for hiring and outsourcing in the online labor market. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1109\u20131118","DOI":"10.1145\/3219819.3220056"},{"key":"827_CR3","doi-asserted-by":"crossref","unstructured":"Badanidiyuru A, Mirzasoleiman B, Karbasi A, Krause A (2014) Streaming submodular maximization: massive data summarization on the fly. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 671\u2013680","DOI":"10.1145\/2623330.2623637"},{"key":"827_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1214\/18-AOS1804","volume":"48","author":"D Bertsimas","year":"2020","unstructured":"Bertsimas D, Van Parys B (2020) Sparse high-dimensional regression: exact scalable algorithms and phase transitions. Ann Stat 48:300\u2013323","journal-title":"Ann Stat"},{"key":"827_CR5","unstructured":"Bian AA, Buhmann JM, Krause A, Tschiatschek S (2017) Guarantees for greedy maximization of non-submodular functions with applications. In: Proceedings of the 34th international conference on machine learning, pp 498\u2013507"},{"key":"827_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s40305-014-0053-z","volume":"2","author":"D Du","year":"2014","unstructured":"Du D, Li Y, Xiu N, Xu D (2014) Simultaneous approximation of multi-criteria submodular functions maximization. J Oper Res Soc China 2:271\u2013290","journal-title":"J Oper Res Soc China"},{"key":"827_CR7","unstructured":"Ene A (2020) A note on maximizing the difference between a monotone submodular function and a linear function. ArXiv preprint arXiv: 2002.07782"},{"key":"827_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of $$\\ln n$$ for approximating set cover. J ACM 45:634\u2013652","journal-title":"J ACM"},{"key":"827_CR9","doi-asserted-by":"crossref","unstructured":"Feldman M (2019) Guess free maximization of submodular and linear sums. In: Proceedings of the 16th international conference workshop on algorithms and data structures, pp 380\u2013394","DOI":"10.1007\/978-3-030-24766-9_28"},{"key":"827_CR10","doi-asserted-by":"crossref","unstructured":"Friedrich T, G\u00f6bel A, Neumann F, Quinzan F, Rothenberger R (2019) Greedy maximization of functions with bounded curvature under partition matroid constraints. In: Proceedings of the 33rd AAAI conference on artificial intelligence, pp 2272\u20132279","DOI":"10.1609\/aaai.v33i01.33012272"},{"key":"827_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2015.02.015","volume":"584","author":"L Gargano","year":"2015","unstructured":"Gargano L, Hell P, Peters JG, Vaccaro U (2015) Influence diffusion in social networks under time window constraints. Theoret Comput Sci 584:53\u201366","journal-title":"Theoret Comput Sci"},{"key":"827_CR12","doi-asserted-by":"crossref","unstructured":"Golshan B, Lappas T, Terzi E (2014) Profit-maximizing cluster hires. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1196\u20131205","DOI":"10.1145\/2623330.2623690"},{"key":"827_CR13","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s10898-019-00800-2","volume":"75","author":"S Gong","year":"2019","unstructured":"Gong S, Nong Q, Liu W, Fang Q (2019) Parametric monotone function maximization with matroid constraints. J Global Optim 75:833\u2013849","journal-title":"J Global Optim"},{"key":"827_CR14","unstructured":"Harshaw C, Feldman M, Ward J, Karbasi A (2019) Submodular maximization beyond non-negativity: guarantees, fast algorithms, and applications. In: Proceedings of the 36th international conference on machine learning, pp 2634\u20132643"},{"key":"827_CR15","unstructured":"Hu H, Grubb A, Bagnell JA, Hebert M (2016) Efficient feature group sequencing for anytime linear prediction. In: Proceedings of the 32nd conference on uncertainty in artificial intelligence, pp 279\u2013288"},{"key":"827_CR16","unstructured":"Kuhnle A, Smith JD, Crawford VG, Thai MT (2018) Fast maximization of non-submodular, monotonic functions on the integer lattice. In: Proceedings of the 35th international conference on machine learning, pp 2791\u20132800"},{"key":"827_CR17","doi-asserted-by":"crossref","unstructured":"Lappas T, Liu K, Terzi E (2009) Finding a team of experts in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, pp 467\u2013476","DOI":"10.1145\/1557019.1557074"},{"key":"827_CR18","doi-asserted-by":"crossref","unstructured":"Liu S, Poon CK (2017) A simple greedy algorithm for the profit-aware social team formation problem. In: Proceedings of the 11th international conference on combinatorial optimization and applications, pp 379\u2013393","DOI":"10.1007\/978-3-319-71147-8_26"},{"key":"827_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S Muthukrishnan","year":"2005","unstructured":"Muthukrishnan S (2005) Data streams: algorithms and applications. Found Trends Theor Comput Sci 1:117\u2013236","journal-title":"Found Trends Theor Comput Sci"},{"key":"827_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou CH, Yannakakis M (1991) Optimization, approximation, and complexity classes. J Comput Syst Sci 43:425\u2013440","journal-title":"J Comput Syst Sci"},{"key":"827_CR21","unstructured":"Qian C (2019) Multi-objective evolutionary algorithms are still good: maximizing monotone approximately submodular minus modular functions. ArXiv preprint arXiv: 1910.05492"},{"key":"827_CR22","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/moor.2016.0842","volume":"42","author":"M Sviridenko","year":"2017","unstructured":"Sviridenko M, Vondr\u00e1k J, Ward J (2017) Optimal approximation for submodular and supermodular optimization with bounded curvature. Math Oper Res 42:1197\u20131218","journal-title":"Math Oper Res"},{"key":"827_CR23","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10898-019-00840-8","volume":"76","author":"Y Wang","year":"2020","unstructured":"Wang Y, Xu D, Wang Y, Zhang D (2020) Non-submodular maximization on massive data streams. J Global Optim 76:729\u2013743","journal-title":"J Global Optim"},{"key":"827_CR24","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2019.05.046","volume":"807","author":"M Wu","year":"2020","unstructured":"Wu M, Wicker M, Ruan W, Huang X, Kwiatkowska M (2020) A game-based approximate verification of deep neural networks with provable guarantees. Theoret Comput Sci 807:298\u2013329","journal-title":"Theoret Comput Sci"},{"key":"827_CR25","doi-asserted-by":"publisher","first-page":"14367","DOI":"10.1109\/ACCESS.2018.2809547","volume":"6","author":"Q Yu","year":"2018","unstructured":"Yu Q, Li H, Liao Y, Cui S (2018) Fast budgeted influence maximization over multi-action event logs. IEEE Access 6:14367\u201314378","journal-title":"IEEE Access"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00827-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00827-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00827-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:24:09Z","timestamp":1665779049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00827-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,2]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["827"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00827-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,2]]},"assertion":[{"value":"5 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}