{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:54:47Z","timestamp":1757620487249,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502141"},{"type":"electronic","value":"9789819502158"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-0215-8_11","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T16:25:24Z","timestamp":1753979124000},"page":"136-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Regularized Submodular Maximization over\u00a0Integer Lattice"],"prefix":"10.1007","author":[{"given":"Zhicheng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yang","family":"Lv","sequence":"additional","affiliation":[]},{"given":"Yapu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhenning","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"issue":"1\u201323","key":"11_CR1","first-page":"17","volume":"23","author":"K Bodek","year":"2022","unstructured":"Bodek, K., Feldman, M.: Maximizing sums of non-monotone submodular and linear functions: understanding the unconstrained case. ESA 23(1\u201323), 17 (2022)","journal-title":"ESA"},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1137\/130929205","volume":"44","author":"N Buchbinder","year":"2015","unstructured":"Buchbinder, N., Feldman, M., Naor, J., Schwartz, R.: A tight linear time (1\/2)-approximation for unconstrained submodular maximization. SIAM J. Comput. 44(5), 1384\u20131402 (2015)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Fisher, M.L., Nemhauser G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions\u2013ii. In: Balinski, M.L., Hoffman, A.J. (eds) Polyhedral Combinatorics. Mathematical Programming Studies, vol. 8, pp. 73\u201387. Springer, Berlin, Heidelberg (1978). https:\/\/doi.org\/10.1007\/BFb0121195","key":"11_CR3","DOI":"10.1007\/BFb0121195"},{"doi-asserted-by":"crossref","unstructured":"Gottschalk, O., Peis, B.: Submodular function maximization on the bounded integer lattice. In: WAOA, pp. 133\u2013144 (2015)","key":"11_CR4","DOI":"10.1007\/978-3-319-28684-6_12"},{"unstructured":"Harshaw, C., Feldman, M., Ward, J., Karbasi, A.: Submodular maximization beyond non-negativity: guarantees, fast algorithms, and applications. In: Proceedings of the 36th International Conference on Machine Learning (ICML), pp. 2634\u20132643 (2019)","key":"11_CR5"},{"issue":"10","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.14778\/3467861.3467866","volume":"14","author":"T Jin","year":"2021","unstructured":"Jin, T., Yang, Y., Yang, R., Shi, J., Huang, K., Xiao, X.: Unconstrained submodular maximization with modular costs: tight approximation and application to profit maximization. Proc. VLDB Endow. 14(10), 1756\u20131768 (2021)","journal-title":"Proc. VLDB Endow."},{"unstructured":"Kazemi, E., Minaee, S., Feldman, M., Karbasi, A.: Regularized submodular maximization at scale. In: ICML, pp. 5356\u20135366 (2021)","key":"11_CR7"},{"unstructured":"Krause. A., Guestrin, A.: Near-optimal nonmyopic value of information in graphical models. In: UAI, p. 5 (2005)","key":"11_CR8"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s11590-016-1039-z","volume":"11","author":"J Laitila","year":"2017","unstructured":"Laitila, J., Moilanen, A.: New performance guarantees for the greedy maximization of submodular set functions. Optim. Lett. 11, 655\u2013665 (2017)","journal-title":"Optim. Lett."},{"unstructured":"Lu, C., Yang, W., Gao, S.: Regularized nonmonotone submodular maximization. Optimization, 1\u201327(2024)","key":"11_CR10"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-i. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1007\/s10878-020-00558-4","volume":"39","author":"Q Nong","year":"2020","unstructured":"Nong, Q., Fang, J., Gong, S., Du, D., Feng, Y., Qu, X.: A 1\/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice. J. Comb. Optim. 39(4), 1208\u20131220 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00558-4","journal-title":"J. Comb. Optim."},{"doi-asserted-by":"crossref","unstructured":"Nikolakaki, S., Ene, A., Terzi, E.: An efficient framework for balancing submodularity and cost. In: KDD, pp. 1256\u20131266 (2021)","key":"11_CR13","DOI":"10.1145\/3447548.3467367"},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1007\/s00453-023-01183-3","volume":"86","author":"B Qi","year":"2024","unstructured":"Qi, B.: On maximizing sums of non-monotone submodular and linear functions. Algorithmica 86(4), 1080\u20131134 (2024)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Qiang, Y., Liu, B.: Dynamic DR-submodular maximization with linear costs over the integer lattice. In: AAIM (1), pp. 109\u2013121 (2024)","key":"11_CR15","DOI":"10.1007\/978-981-97-7798-3_10"},{"issue":"6","key":"11_CR16","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.23919\/JSEE.2020.000086","volume":"31","author":"Z Rong","year":"2020","unstructured":"Rong, Z., Hemin, S., Hao, L., Weilin, L.: TDOA and track optimization of UAV swarm based on D-optimality. J. Syst. Eng. Electron. 31(6), 1140\u20131151 (2020)","journal-title":"J. Syst. Eng. Electron."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.sigpro.2016.05.011","volume":"128","author":"V Roy","year":"2016","unstructured":"Roy, V., Simonetto, A., Leus, G.: Spatio-temporal sensor management for environmental field estimation. Signal Process. 128, 369\u2013381 (2016)","journal-title":"Signal Process."},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.disopt.2013.02.002","volume":"10","author":"AS Schulz","year":"2013","unstructured":"Schulz, A.S., Uhan, N.A.: Approximating the least core value and least core of cooperative games with supermodular costs. Discrete Optim. 10(2), 163\u2013180 (2013)","journal-title":"Discrete Optim."},{"unstructured":"Soma, T., Kakimura, N., Inaba, K., Kawarabayashi, K.: Optimal budget allocation: theoretical guarantee and efficient algorithm. In: ICML, pp. 351\u2013359 (2014)","key":"11_CR19"},{"doi-asserted-by":"publisher","unstructured":"Soma, T., Yoshida, Y.: Maximizing monotone submodular functions over the integer lattice. Math. Program. (4), 539\u2013563 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1324-y","key":"11_CR20","DOI":"10.1007\/s10107-018-1324-y"},{"doi-asserted-by":"crossref","unstructured":"Sun, X., Han, C., Wu, C., Xu, D., Zhou Y.: The regularized submodular maximization via the lyapunov method. COCOON (2), 118\u2013143 (2023)","key":"11_CR21","DOI":"10.1007\/978-3-031-49193-1_10"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0215-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T09:17:28Z","timestamp":1757323048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0215-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9789819502141","9789819502158"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0215-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}