{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:02:27Z","timestamp":1746331347723,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819644476","type":"print"},{"value":"9789819644483","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-4448-3_10","type":"book-chapter","created":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:50:47Z","timestamp":1746251447000},"page":"119-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Algorithms for\u00a0Non-monotone Submodular Maximization"],"prefix":"10.1007","author":[{"given":"Yuanyang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,4]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Banihashem, K., Biabani, L., Goudarzi, S., Hajiaghayi, M., Jabbarzade, P., Monemizadeh, M.: Dynamic algorithms for matroid submodular maximization. In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024 (2024)","DOI":"10.1137\/1.9781611977912.125"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Feldman, M., Naor, J., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: Proceedings of 52nd Annual IEEE Symposium Foundations of Computer Science (FOCS), pp. 570\u2013579 (2011)","DOI":"10.1109\/FOCS.2011.46"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Chen, X., Peng, B.: On the complexity of dynamic submodular maximization. In: STOC 2022: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, pp. 1685\u20131698 (2022)","DOI":"10.1145\/3519935.3519951"},{"key":"10_CR4","unstructured":"Monemizadeh, M.: Dynamic submodular maximization. In: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems (2020)"},{"key":"10_CR5","unstructured":"Banihashem, K., Biabani, L., Goudarzi, S., Hajiaghayi, M., Jabbarzade, P., Monemizadeh, M.: Dynamic non-monotone submodular maximization. In: Thirty-Seventh Conference on Neural Information Processing Systems (2023)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Fusco, F., Lattanzi, S., Norouzi-Fard, A., Zadimoghaddam, M.: Fully dynamic submodular maximization over matroids (2023)","DOI":"10.1145\/3698397"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Seffi, J., Schwartz, R.: A tight linear time (1\/2)-approximation for unconstrained submodular maximization. SIAM J. Comput. 44(5), 1384\u20131402 (2015)","DOI":"10.1137\/130929205"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U., Mirrokni, V.S., Vondr\u00e1k, J.: Maximizing non-monotone submodular functions. SIAM J. Comput. 40(4), 1133\u20131153 (2011)","DOI":"10.1137\/090779346"},{"issue":"1","key":"10_CR9","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."},{"key":"10_CR10","unstructured":"Lattanzi, S., Mitrovic, S., Norouzi-Fard, A., Tarnawski, J., Zadimoghaddam, M.: Fully dynamic algorithm for constrained submodular optimization. In: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020 (2020)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4448-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T05:50:54Z","timestamp":1746251454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4448-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819644476","9789819644483"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4448-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cocoa2024.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}