{"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":1774406018390,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T00:00:00Z","timestamp":1673913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T00:00:00Z","timestamp":1673913600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Guangxi Key Laboratory of Cryptography and Information Security","award":["GCIS202116"],"award-info":[{"award-number":["GCIS202116"]}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019MA022"],"award-info":[{"award-number":["ZR2019MA022"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Project of Shenzhen City","award":["JCYJ20210324102012033"],"award-info":[{"award-number":["JCYJ20210324102012033"]}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901158"],"award-info":[{"award-number":["11901158"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12131003"],"award-info":[{"award-number":["12131003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Natural Science Foundation Project","award":["Z200002"],"award-info":[{"award-number":["Z200002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10878-023-00986-y","type":"journal-article","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T19:02:37Z","timestamp":1673982157000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice"],"prefix":"10.1007","volume":"45","author":[{"given":"Jingjing","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,17]]},"reference":[{"key":"986_CR1","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 KDD, pp 671\u2013680","DOI":"10.1145\/2623330.2623637"},{"key":"986_CR2","unstructured":"Bai W, Bilmes JA (2018) Greed is still good: maximizing monotone submodular+supermodular functions. In: Proceedings of ICML, pp 1\u201310"},{"key":"986_CR3","doi-asserted-by":"crossref","unstructured":"Buchbinder N, Feldman M, Schwartz R (2015) Onling submodular maximization with preemption. In: Proceedings of SODA, pp. 1202\u20131216","DOI":"10.1137\/1.9781611973730.80"},{"key":"986_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-015-0900-7","volume":"154","author":"A Chakrabarti","year":"2015","unstructured":"Chakrabarti A, Kale S (2015) Submodular maximization meets streaming: matchings, matroids, and more. Math Program 154:225\u2013247","journal-title":"Math Program"},{"key":"986_CR5","unstructured":"Das A, Kempe D (2011) Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In: Proceedings of ICML, pp 1057\u20131064"},{"key":"986_CR6","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1287\/opre.1110.1000","volume":"60","author":"S He","year":"2012","unstructured":"He S, Zhang J, Zhang S (2012) Polymatroid optimization, submodularity, and joint replenishment games. Oper Res 60:128\u2013137","journal-title":"Oper Res"},{"key":"986_CR7","doi-asserted-by":"crossref","unstructured":"Huang C, Kakimura N (2019) Improved streaming algorithms for maximising monotone submodular functions under a knapsack constraint. In: Proceedings of WADS, pp 438\u2013451","DOI":"10.1007\/978-3-030-24766-9_32"},{"key":"986_CR8","doi-asserted-by":"crossref","unstructured":"Ji S, Xu DC, Li M, Wang YJ, Zhang DM (2020) Stochastic greedy algorithm is still good: maximizing submodular + supermodular functions. In: Optimization of complex systems: theory, models, algorithms and applications, pp 488\u2013497","DOI":"10.1007\/978-3-030-21803-4_49"},{"key":"986_CR9","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1007\/s11590-019-01430-z","volume":"14","author":"YJ Jiang","year":"2020","unstructured":"Jiang YJ, Wang YS, Xu DC, Yang RQ, Zhang Y (2020) Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint. Optim Lett 14:1235\u20131248","journal-title":"Optim Lett"},{"key":"986_CR10","unstructured":"Kazemi E, Mitrovic M, Zadimoghaddam M, Lattanzi S, Karbasi A (2019) Submodular streaming in all its glory: tight approximation. Minimum memory and low adaptive complexity, In: Proceedings of ICML, pp 3311\u20133320"},{"key":"986_CR11","unstructured":"Khanna R, Elenberg ER, Dimakis AG, Negahban S, Ghosh J (2017) Scalable greedy feature selection via weak submodularity. In: Proceedings of ICAIS, pp 1560\u20131568"},{"key":"986_CR12","first-page":"235","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause A, Singh A, Guestrin C (2008) Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies. J Mach Learn Res 9:235\u2013284","journal-title":"J Mach Learn Res"},{"key":"986_CR13","unstructured":"Kuhnle A, Smith J, Crawford V, Thai M (2018) Fast maximization of non-submodular, monotonic functions on the integer lattice. In: Proceedings of ICML, pp 2791\u20132800"},{"key":"986_CR14","unstructured":"Norouzi-Fard A, Tarnawski J, Mitrovic S, Zandieh A, Mousavifar A, Svensson O (2018) Beyond 1\/2-approximation for submodular maximization on massive data streams. In: Proceedings of ICML, pp 3829\u20133838"},{"key":"986_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2018.11.002","volume":"47","author":"KK Sarpatwar","year":"2019","unstructured":"Sarpatwar KK, Schieber B, Shachnai H (2019) Constrained submodular maximization via greedy local search. Oper Res Lett 47:1\u20136","journal-title":"Oper Res Lett"},{"key":"986_CR16","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-018-1324-y","volume":"172","author":"T Soma","year":"2018","unstructured":"Soma T, Yoshida Y (2018) Maximization monotone submodular functions over the integer lattice. Math Program 172:539\u2013563","journal-title":"Math Program"},{"key":"986_CR17","doi-asserted-by":"crossref","unstructured":"Sviridenko M, Vondrak J, Ward J (2015) Optimal approximation for submodular and supermodular optimization with bounded curvature. In: Proceedings of SODA, pp 1134\u20131148","DOI":"10.1137\/1.9781611973730.76"},{"key":"986_CR18","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10898-019-00840-8","volume":"76","author":"YJ Wang","year":"2020","unstructured":"Wang YJ, Xu DC, Wang YS, Zhang DM (2020) Non-submodular maximization on massive data streams. J Global Optim 76:729\u2013743","journal-title":"J Global Optim"},{"key":"986_CR19","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1287\/moor.7.3.410","volume":"7","author":"L Wolsey","year":"1982","unstructured":"Wolsey L (1982) Maximising real-valued submodular set function: primal and dual heuristics for location problems. Math Oper Res 7:410\u2013425","journal-title":"Math Oper Res"},{"key":"986_CR20","first-page":"123","volume":"2019","author":"RQ Yang","year":"2019","unstructured":"Yang RQ, Xu DC, Li M, Xu YC (2019a) Thresholding methods for streaming submodular maximization with a cardinality constraint and its variants. Nonlinear Comb Optim 2019:123\u2013140","journal-title":"Nonlinear Comb Optim"},{"key":"986_CR21","doi-asserted-by":"crossref","unstructured":"Yang RQ, Xu DC, Du DL, Xu YC, Yan XH (2019b) Maximization of constrained non-submodular functions. In: Proceedings of COCOON, pp 615\u2013626","DOI":"10.1007\/978-3-030-26176-4_51"},{"key":"986_CR22","unstructured":"Yu QL, Xu EL, Cui SG (2016) Streaming algorithms for news and scientific literature recommendation: submodular maximization with a d-knapsack constraint. In: Proceedings of IEEE GCSI, https:\/\/arxiv.org\/abs\/1603.05614"},{"key":"986_CR23","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10898-021-01014-1","volume":"80","author":"ZZ Zhang","year":"2021","unstructured":"Zhang ZZ, Du DL, Jiang YJ, Wu CC (2021) Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint. J Global Optim 80:595\u2013616","journal-title":"J Global Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-00986-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-00986-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-00986-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T03:47:46Z","timestamp":1680061666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-00986-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,17]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["986"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-00986-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,17]]},"assertion":[{"value":"22 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"55"}}