{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T16:47:52Z","timestamp":1770137272521,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11432-020-3420-9","type":"journal-article","created":{"date-parts":[[2022,3,19]],"date-time":"2022-03-19T05:02:57Z","timestamp":1647666177000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Regularized two-stage submodular maximization under streaming"],"prefix":"10.1007","volume":"65","author":[{"given":"Ruiqi","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"3420_CR1","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9. Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington DC, 2003. 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"3420_CR2","unstructured":"Lin H, Bilmes J. A class of submodular functions for document summarization. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies-Volume 1, Portland, 2011. 510\u2013520"},{"key":"3420_CR3","first-page":"2761","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause A, McMahan H B, Guestrin C, et al. Robust submodular observation selection. J Machine Learn Res, 2008, 9: 2761\u20132801","journal-title":"J Machine Learn Res"},{"key":"3420_CR4","unstructured":"Balkanski E, Mirzasoleiman B, Krause A, et al. Learning sparse combinatorial representations via two-stage submodular maximization. In: Proceedings of the 33rd International Conference on International Conference on Machine Learning, New York City, 2016. 2207\u20132216"},{"key":"3420_CR5","doi-asserted-by":"crossref","unstructured":"Badanidiyuru A, Mirzasoleiman B, Karbasi A, et al. Streaming submodular maximization: massive data summarization on the fly. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York City, 2014. 671\u2013680","DOI":"10.1145\/2623330.2623637"},{"key":"3420_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G L Nemhauser","year":"1978","unstructured":"Nemhauser G L, Wolsey L A, Fisher M L. An analysis of approximations for maximizing submodular set functions-I. Math Programming, 1978, 14: 265\u2013294","journal-title":"Math Programming"},{"key":"3420_CR7","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu G, Chekuri C, P\u00e1l M, et al. Maximizing a monotone submodular function subject to a matroid constraint. SIAM J Comput, 2011, 40: 1740\u20131766","journal-title":"SIAM J Comput"},{"key":"3420_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko M. A note on maximizing a submodular set function subject to a knapsack constraint. Operations Res Lett, 2004, 32: 41\u201343","journal-title":"Operations Res Lett"},{"key":"3420_CR9","doi-asserted-by":"crossref","unstructured":"Buchbinder N, Feldman M, Schwartz R. Online submodular maximization with preemption. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, 2015. 1202\u20131216","DOI":"10.1137\/1.9781611973730.80"},{"key":"3420_CR10","unstructured":"Norouzi-Fard A, Tarnawski J, Mitrovi\u0107 S, et al. Beyond 1\/2-approximation for submodular maximization on massive data streams. In: Proceedings of the 35th International Conference on Machine Learning, Stockholm, 2018. 3826\u20133835"},{"key":"3420_CR11","unstructured":"Kazemi E, Mitrovic M, Zadimoghaddam M, et al. Submodular streaming in all its glory: tight approximation, minimum memory and low adaptive complexity. In: Proceedings of International Conference on Machine Learning, Long Beach, 2019. 3311\u20133320"},{"key":"3420_CR12","doi-asserted-by":"crossref","unstructured":"Chekuri C, Gupta S, Quanrud K. Streaming algorithms for submodular function maximization. In: Proceedings of International Colloquium on Automata, Languages and Programming, Kyoto, 2015. 318\u2013330","DOI":"10.1007\/978-3-662-47672-7_26"},{"key":"3420_CR13","doi-asserted-by":"crossref","unstructured":"Huang C C, Kakimura N. Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. In: Proceedings of the 16th International Symposium Workshop on Algorithms and Data Structures, Edmonton, 2019. 438\u2013451","DOI":"10.1007\/978-3-030-24766-9_32"},{"key":"3420_CR14","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1007\/s00453-019-00628-y","volume":"82","author":"C C Huang","year":"2020","unstructured":"Huang C C, Kakimura N, Yoshida Y. Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. Algorithmica, 2020, 82: 1006\u20131032","journal-title":"Algorithmica"},{"key":"3420_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2809814","volume":"2","author":"R Kumar","year":"2015","unstructured":"Kumar R, Moseley B, Vassilvitskii S, et al. Fast greedy algorithms in MapReduce and streaming. ACM Trans Parallel Comput, 2015, 2: 1\u201322","journal-title":"ACM Trans Parallel Comput"},{"key":"3420_CR16","doi-asserted-by":"crossref","unstructured":"Mirzasoleiman B, Jegelka S, Krause A. Streaming non-monotone submodular maximization: personalized video summarization on the fly. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence, New Orleans, 2018. 1379\u20131386","DOI":"10.1609\/aaai.v32i1.11529"},{"key":"3420_CR17","doi-asserted-by":"crossref","unstructured":"Feldman M. Guess free maximization of submodular and linear sums. In: Proceedings of Workshop on Algorithms and Data Structures, Edmonton, 2019. 380\u2013394","DOI":"10.1007\/978-3-030-24766-9_28"},{"key":"3420_CR18","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. Optimal approximation for submodular and supermodular optimization with bounded curvature. Math OR, 2017, 42: 1197\u20131218","journal-title":"Math OR"},{"key":"3420_CR19","unstructured":"Harshaw C, Feldman M, Ward J, et al. Submodular maximization beyond non-negativity: guarantees, fast algorithms, and applications. In: Proceedings of the 36th International Conference on Machine Learning, Long Beach, 2019. 2634\u20132643"},{"key":"3420_CR20","unstructured":"Kazemi E, Minaee S, Feldman M, et al. Regularized submodular maximization at scale. In: Proceedings of International Conference on Machine Learning, 2021. 5356\u20135366"},{"key":"3420_CR21","unstructured":"Stan S, Zadimoghaddam M, Krause A, et al. Probabilistic submodular maximization in sub-linear time. In: Proceedings of International Conference on Machine Learning, Sydney, 2017. 3241\u20133250"},{"key":"3420_CR22","unstructured":"Mitrovic M, Kazemi E, Zadimoghaddam M, et al. Data summarization at scale: a two-stage submodular approach. In: Proceedings of the 35th International Conference on Machine Learning, Stockholm, 2018. 3593\u20133602"},{"key":"3420_CR23","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, et al. Parametric monotone function maximization with matroid constraints. J Glob Optim, 2019, 75: 833\u2013849","journal-title":"J Glob Optim"},{"key":"3420_CR24","doi-asserted-by":"crossref","unstructured":"Yang R, Xu D, Guo L, et al. Parametric streaming two-stage submodular maximization. In: Proceedings of the 16th Annual Conference on Theory and Applications of Models of Computation (TAMC), Changsha, 2020. 193\u2013204","DOI":"10.1007\/978-3-030-59267-7_17"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3420-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-020-3420-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-3420-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T21:03:27Z","timestamp":1683234207000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-020-3420-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["3420"],"URL":"https:\/\/doi.org\/10.1007\/s11432-020-3420-9","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"31 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"140602"}}