{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:11:22Z","timestamp":1779448282692,"version":"3.53.1"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Shandong Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115877","type":"journal-article","created":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:12:39Z","timestamp":1772842359000},"page":"115877","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Dynamic algorithms for maximizing a DR-submodular function subtracted by a linear function over the integer lattice"],"prefix":"10.1016","volume":"1072","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4342-9774","authenticated-orcid":false,"given":"Yuanyuan","family":"Qiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8958-3999","authenticated-orcid":false,"given":"Bin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115877_bib0001","series-title":"Proceedings of the 5th International Conference on Information Processing in Sensor Networks","first-page":"2","article-title":"Near-optimal sensor placements: maximizing information while minimizing communication cost","author":"Krause","year":"2006"},{"issue":"1","key":"10.1016\/j.tcs.2026.115877_bib0002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10878-022-00946-y","article-title":"Algorithms for influence maximization in socio-physical networks","volume":"45","author":"Gehlot","year":"2023","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2026.115877_bib0003","series-title":"Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"key":"10.1016\/j.tcs.2026.115877_bib0004","series-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing","first-page":"229","article-title":"Optimization, approximation, and complexity classes","author":"Papadimitriou","year":"1988"},{"key":"10.1016\/j.tcs.2026.115877_bib0005","series-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing","first-page":"314","article-title":"A threshold of ln\u2009n for approximating set cover (preliminary version)","author":"Feige","year":"1996"},{"issue":"3","key":"10.1016\/j.tcs.2026.115877_bib0006","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1007\/s00453-020-00757-9","article-title":"Guess free maximization of submodular and linear sums","volume":"83","author":"Feldman","year":"2021","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/j.tcs.2026.115877_bib0007","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s40305-014-0053-z","article-title":"Simultaneous approximation of multi-criteria submodular function maximization","volume":"2","author":"Du","year":"2014","journal-title":"J. Oper. Res. Soc. China"},{"issue":"4","key":"10.1016\/j.tcs.2026.115877_bib0008","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1287\/moor.2016.0842","article-title":"Optimal approximation for submodular and supermodular optimization with bounded curvature","volume":"42","author":"Sviridenko","year":"2017","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.tcs.2026.115877_bib0009","series-title":"Proceedings of the 36th International Conference on Machine Learning","first-page":"2634","article-title":"Submodular maximization beyond non-negativity: guarantees, fast algorithms, and applications","author":"Harshaw","year":"2019"},{"key":"10.1016\/j.tcs.2026.115877_bib0010","series-title":"Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","first-page":"1256","article-title":"An efficient framework for balancing submodularity and cost","author":"Nikolakaki","year":"2021"},{"key":"10.1016\/j.tcs.2026.115877_bib0011","article-title":"Submodular Functions and Optimization","author":"Fujishige","year":"2005"},{"key":"10.1016\/j.tcs.2026.115877_bib0012","series-title":"Proceedings of the 20th Artificial Intelligence and Statistics","first-page":"111","article-title":"Guaranteed non-convex optimization: submodular maximization over continuous domains","author":"Bian","year":"2017"},{"key":"10.1016\/j.tcs.2026.115877_bib0013","series-title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","first-page":"1820","article-title":"Constrained submodular maximization via new bounds for DR-submodular functions","author":"Buchbinder","year":"2024"},{"key":"10.1016\/j.tcs.2026.115877_bib0014","series-title":"Proceedings of the 13th International Workshop on Approximation and Online Algorithms","first-page":"133","article-title":"Submodular function maximization on the bounded integer lattice","author":"Gottschalk","year":"2015"},{"issue":"1","key":"10.1016\/j.tcs.2026.115877_bib0015","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10898-022-01193-5","article-title":"A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice","volume":"85","author":"Gong","year":"2023","journal-title":"J. Global Optim."},{"issue":"5","key":"10.1016\/j.tcs.2026.115877_bib0016","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1007\/s00453-023-01195-z","article-title":"Stochastic variance reduction for DR-submodular maximization","volume":"86","author":"Lian","year":"2024","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115877_bib0017","series-title":"Proceedings of the 31st AAAI Conference on Artificial Intelligence","first-page":"898","article-title":"Non-monotone DR-submodular function maximization","author":"Soma","year":"2017"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.115877_bib0018","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s10107-018-1324-y","article-title":"Maximizing monotone submodular functions over the integer lattice","volume":"172","author":"Soma","year":"2018","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.tcs.2026.115877_bib0019","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1142\/S179383092050007X","article-title":"A fast double greedy algorithm for non-monotone DR-submodular function maximization","volume":"12","author":"Gu","year":"2020","journal-title":"Discrete Math. Algorithm Appl."},{"key":"10.1016\/j.tcs.2026.115877_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114254","article-title":"A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity","volume":"981","author":"Chen","year":"2024","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2026.115877_bib0021","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s10878-024-01158-2","article-title":"Differentially private submodular maximization with a cardinality constraint over the integer lattice","volume":"47","author":"Hu","year":"2024","journal-title":"J. Comb. Optim."},{"issue":"2","key":"10.1016\/j.tcs.2026.115877_bib0022","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10878-023-00986-y","article-title":"On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice","volume":"45","author":"Tan","year":"2023","journal-title":"J. Comb. Optim."},{"issue":"3","key":"10.1016\/j.tcs.2026.115877_bib0023","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s40305-022-00393-w","article-title":"Maximizing the differences between a monotone DR-Submodular function and a linear function on the integer lattice","volume":"12","author":"Zhang","year":"2024","journal-title":"J. Oper. Res. Soc. China"},{"key":"10.1016\/j.tcs.2026.115877_bib0024","series-title":"Technical Report","article-title":"A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns","author":"Ene","year":"2016"},{"key":"10.1016\/j.tcs.2026.115877_bib0025","series-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems","first-page":"9806","article-title":"Dynamic submodular maximization","author":"Monemizadeh","year":"2020"},{"key":"10.1016\/j.tcs.2026.115877_bib0026","series-title":"Proceedings of the International Conference on Neural Information Processing Systems","first-page":"12923","article-title":"Fully dynamic algorithm for constrained submodular optimization","author":"Lattanzi","year":"2020"},{"key":"10.1016\/j.tcs.2026.115877_bib0027","series-title":"Proceedings of the 4th International Conference on Machine Learning","first-page":"8821","article-title":"Fully dynamic submodular maximization over matroids","author":"D\u00fctting","year":"2023"},{"key":"10.1016\/j.tcs.2026.115877_bib0028","series-title":"Proceedings of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"3485","article-title":"Dynamic algorithms for matroid submodular maximization","author":"Banihashem","year":"2024"},{"key":"10.1016\/j.tcs.2026.115877_bib0029","series-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"671","article-title":"Streaming submodular maximization: massive data summarization on the fly","author":"Badanidiyuru","year":"2014"},{"key":"10.1016\/j.tcs.2026.115877_bib0030","series-title":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","first-page":"1363","article-title":"The one-way communication complexity of submodular maximization with applications to streaming and robustness","author":"Feldman","year":"2020"},{"issue":"1","key":"10.1016\/j.tcs.2026.115877_bib0031","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10878-020-00662-5","article-title":"Sequence submodular maximization meets streaming","volume":"41","author":"Yang","year":"2021","journal-title":"J. Comb. Optim."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001362?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001362?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:02:51Z","timestamp":1779447771000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":31,"alternative-id":["S0304397526001362"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115877","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dynamic algorithms for maximizing a DR-submodular function subtracted by a linear function over the integer lattice","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115877","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115877"}}