{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T04:03:15Z","timestamp":1758600195957,"version":"3.44.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T00:00:00Z","timestamp":1754524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T00:00:00Z","timestamp":1754524800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12471302"],"award-info":[{"award-number":["12471302"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007834","name":"Natural Science Foundation of Ningbo Municipality","doi-asserted-by":"publisher","award":["2024J195"],"award-info":[{"award-number":["2024J195"]}],"id":[{"id":"10.13039\/100007834","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10288-025-00593-z","type":"journal-article","created":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:23:33Z","timestamp":1754555013000},"page":"303-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Streaming algorithms for non-monotone DR-submodular maximization under a knapsack constraint on the integer lattice"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6637-005X","authenticated-orcid":false,"given":"Hongyang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenchang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,7]]},"reference":[{"key":"593_CR1","doi-asserted-by":"crossref","unstructured":"Cui S, Han K, Tang J, Huang H, Li X, Li Z (2023) Streaming algorithms for constrained submodular maximization. In proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, (pp. 65-66)","DOI":"10.1145\/3578338.3593573"},{"key":"593_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113847","volume":"957","author":"S Gu","year":"2023","unstructured":"Gu S, Gao C, Huang J, Wu W (2023) Profit maximization in social networks and non-monotone DR-submodular maximization. Theoret Comput Sci 957:113847","journal-title":"Theoret Comput Sci"},{"issue":"1","key":"593_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10898-022-01193-5","volume":"85","author":"S Gong","year":"2023","unstructured":"Gong S, Nong Q, Bao S, Fang Q, Du D (2023) A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice. J Global Optim 85(1):15\u201338","journal-title":"J Global Optim"},{"key":"593_CR4","doi-asserted-by":"crossref","unstructured":"Han K, Cui S, Zhu T, et al (2021) Approximation algorithms for submodular data summarization with a knapsack constraint. In proceedings of the 2021 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, (pp. 05:1-05:31)","DOI":"10.1145\/3410220.3453922"},{"issue":"4","key":"593_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-024-01158-2","volume":"47","author":"J Hu","year":"2024","unstructured":"Hu J, Xu D, Du D, Miao C (2024) Differentially private submodular maximization with a cardinality constraint over the integer lattice. J Comb Optim 47(4):58","journal-title":"J Comb Optim"},{"issue":"1","key":"593_CR6","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s10878-022-00975-7","volume":"45","author":"B Liu","year":"2023","unstructured":"Liu B, Chen Z, Wang H, Wu W (2023) An optimal streaming algorithm for non-submodular functions maximization on the integer lattice. J Comb Optim 45(1):42","journal-title":"J Comb Optim"},{"issue":"7","key":"593_CR7","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1007\/s11590-023-01979-w","volume":"17","author":"C Lu","year":"2023","unstructured":"Lu C, Yang W, Gao S (2023) Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions. Optimization Letters 17(7):1643\u20131667","journal-title":"Optimization Letters"},{"key":"593_CR8","doi-asserted-by":"crossref","unstructured":"Qiang Y, Liu B (2024) Dynamic DR-Submodular Maximization with Linear Costs over the Integer Lattice. In proceedings of the 2024 International Conference on Algorithmic Applications in Management, (pp. 109-121)","DOI":"10.1007\/978-981-97-7798-3_10"},{"key":"593_CR9","unstructured":"Soma T, Kakimura N, Inaba K, Kawarabayashi K (2014) Optimal budget allocation: Theoretical guarantee and efficient algorithm. In proceedings of the 2014 International Conference on Machine Learning, (pp. 351-359)"},{"key":"593_CR10","unstructured":"Soma T, Yoshida Y (2015) A generalization of submodular cover via the diminishing return property on the integer lattice. In proceedings of the 2015 Conference on Neural Information Processing Systems, (pp. 847-855)"},{"key":"593_CR11","doi-asserted-by":"crossref","unstructured":"Soma T, Yoshida Y (2017) Non-monotone DR-submodular function maximization. In proceedings of the 2017 AAAI Conference on Artificial Intelligence, (pp. 898-904)","DOI":"10.1609\/aaai.v31i1.10653"},{"key":"593_CR12","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) Maximizing monotone submodular functions over the integer lattice. Math Program 172:539\u2013563","journal-title":"Math Program"},{"key":"593_CR13","doi-asserted-by":"crossref","unstructured":"Tan J, Zhang D, Zhang H, Zhang Z (2022) One-pass streaming algorithm for DR-submodular maximization with a knapsack constraint over the integer lattice. Computer and Electrical Engineering, 99, Article 107766","DOI":"10.1016\/j.compeleceng.2022.107766"},{"key":"593_CR14","doi-asserted-by":"crossref","unstructured":"Tan J, Ge C, Wang F, Li Z (2024) Streaming Algorithm for Balance Gain and Cost with Cardinality Constraint on the Integer Lattice. In proceedings of the 2024 International Computing and Combinatorics Conference, (pp. 324-331)","DOI":"10.1007\/978-981-96-1093-8_27"},{"key":"593_CR15","doi-asserted-by":"crossref","unstructured":"Zhang Z, Guo L, Wang L, Zou J (2023) One-pass streaming algorithm for monotone lattice submodular maximization subject to a cardinality constraint. Concurrency and Computation: Practice and Experience, 35(17)","DOI":"10.1002\/cpe.6645"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00593-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-025-00593-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00593-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T03:07:40Z","timestamp":1758596860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-025-00593-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,7]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["593"],"URL":"https:\/\/doi.org\/10.1007\/s10288-025-00593-z","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2025,8,7]]},"assertion":[{"value":"22 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}