{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:19:41Z","timestamp":1767316781774,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819556564","type":"print"},{"value":"9789819556571","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-5657-1_5","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:15:38Z","timestamp":1767316538000},"page":"47-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for\u00a0Monotone k-Submodular Maximization Under the\u00a0Chance Constraint"],"prefix":"10.1007","author":[{"given":"Qiao","family":"Chen","sequence":"first","affiliation":[]},{"given":"Shufang","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Vondr\u00e1k, J.: Fast algorithms for maximizing submodular functions. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1497\u20131514. SIAM, Portland, Oregon, USA (2014)","DOI":"10.1137\/1.9781611973402.110"},{"issue":"6","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., Pal, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011)","journal-title":"SIAM J. Comput."},{"key":"5_CR3","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: SODA, pp. 642\u2013651. Society for Industrial and Applied Mathematics, Washington, D.C., USA (2001)"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Chen, J., Maehara, T.: Chance-constrained submodular knapsack problem. In: Du, D., Duan, Z., Tian, C. (eds.) Computing and Combinatorics. LNCS, vol. 11653, pp. 103\u2013114. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26176-4_9","DOI":"10.1007\/978-3-030-26176-4_9"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Neumann, A., Neumann, F., Sutton, A.: Optimization of chance-constrained submodular functions. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1460\u20131467. AAAI Press, New York, New York, USA (2020)","DOI":"10.1609\/aaai.v34i02.5504"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM (JACM) 45(4), 634\u2013652 (1998)","journal-title":"J. ACM (JACM)"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Gong, S., Liu, B., Fang, Q.: Streaming submodular maximization with the chance constraint. In: Li, M., Sun, X. (eds.) Frontiers of Algorithmic Wisdom. LNCS, vol. 13461, pp. 129\u2013140. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-20796-9_10","DOI":"10.1007\/978-3-031-20796-9_10"},{"key":"5_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106452","volume":"161","author":"DT Ha","year":"2024","unstructured":"Ha, D.T., Pham, C.V., Tran, T.D.: Improved approximation algorithms for k-submodular maximization under a knapsack constraint. Comput. Oper. Res. 161, 106452 (2024)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1287\/moor.2013.0592","volume":"38","author":"A Kulik","year":"2013","unstructured":"Kulik, A., Shachnai, H., Tamir, T.: Approximations for monotone and nonmonotone submodular maximization with knapsack constraints. Math. Oper. Res. 38(4), 729\u2013739 (2013)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1287\/moor.1100.0463","volume":"35","author":"J Lee","year":"2010","unstructured":"Lee, J., Sviridenko, M., Vondr\u00e1k, J.: Submodular maximization over multiple matroids via generalized exchange properties. Math. Oper. Res. 35(4), 795\u2013806 (2010)","journal-title":"Math. Oper. Res."},{"key":"5_CR11","unstructured":"Lin, H., Bilmes, J.: Multi-document summarization via budgeted maximization of submodular functions. In: Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, pp. 912\u2013920. Association for Computational Linguistics, Los Angeles, California (2010)"},{"issue":"1","key":"5_CR12","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\u2013I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"5_CR13","unstructured":"Neumann, A., Neumann, F.: Optimizing monotone chance-constrained submodular functions using evolutionary multiobjective algorithms. In: Evolutionary Computation, pp. 1\u201331 (2024)"},{"key":"5_CR14","unstructured":"Nie, G., Zhu, Y., Nadew, Y.Y., Basu, S., Pavan, A., Quinn, C.J.: Size-constrained k-submodular maximization in near-linear time. In: Uncertainty in Artificial Intelligence, pp. 1545\u20131554. PMLR, Pittsburgh, PA, USA (2023)"},{"key":"5_CR15","first-page":"694","volume":"28","author":"N Ohsaka","year":"2015","unstructured":"Ohsaka, N., Yoshida, Y.: Monotone k-submodular function maximization with size constraints. Adv. Neural. Inf. Process. Syst. 28, 694\u2013702 (2015)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TEVC.2017.2749263","volume":"22","author":"C Qian","year":"2017","unstructured":"Qian, C., Shi, J.C., Tang, K., Zhou, Z.H.: Constrained monotone $$ k $$-submodular function maximization using multiobjective evolutionary algorithms with theoretical guarantee. IEEE Trans. Evol. Comput. 22(4), 595\u2013608 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01585863","volume":"82","author":"M Queyranne","year":"1998","unstructured":"Queyranne, M.: Minimizing symmetric submodular functions. Math. Programm. 82(1), 3\u201312 (1998)","journal-title":"Math. Programm."},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"key":"5_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114320","volume":"984","author":"Z Tang","year":"2024","unstructured":"Tang, Z., Chen, J., Wang, C.: Greedy+ singleton: an efficient approximation algorithm for k-submodular knapsack maximization. Theoret. Comput. Sci. 984, 114320 (2024)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.orl.2021.11.010","volume":"50","author":"Z Tang","year":"2022","unstructured":"Tang, Z., Wang, C., Chan, H.: On maximizing a monotone k-submodular function under a knapsack constraint. Oper. Res. Lett. 50(1), 28\u201331 (2022)","journal-title":"Oper. Res. Lett."},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Xiao, H., Liu, Q., Zhou, Y., Li, M.: Approximation algorithms for k-submodular maximization subject to a knapsack constraint. J. Oper. Res. Soc. China, 1\u201316 (2024). https:\/\/doi.org\/10.1007\/s40305-024-00539-y","DOI":"10.1007\/s40305-024-00539-y"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Yan, X., Do, A.V., Shi, F., Qin, X., Neumann, F.: Optimizing chance-constrained submodular problems with variable uncertainties. In: ECAI 2023, pp. 2826\u20132833. IOS Press, Krak\u00f3w, Poland (2023)","DOI":"10.3233\/FAIA230594"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Yan, X., Neumann, A., Neumann, F.: Sliding window bi-objective evolutionary algorithms for optimizing chance-constrained monotone submodular functions. In: Affenzeller, M., et al. (eds.) International Conference on Parallel Problem Solving from Nature, pp. 20\u201335. Springer, Hagenberg, Austria (2024). https:\/\/doi.org\/10.1007\/978-3-031-70055-2_2","DOI":"10.1007\/978-3-031-70055-2_2"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5657-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:15:39Z","timestamp":1767316539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5657-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819556564","9789819556571"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5657-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ulaanbaatar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mongolia","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":"23 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.aaim2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}