{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T10:10:10Z","timestamp":1746439810049,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819644445","type":"print"},{"value":"9789819644452","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-4445-2_10","type":"book-chapter","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:34:00Z","timestamp":1746437640000},"page":"113-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximize an Approximate k-submodular Function under a Knapsack Constraint"],"prefix":"10.1007","author":[{"given":"Fanqing","family":"Meng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0895-7793","authenticated-orcid":false,"given":"Qingqin","family":"Nong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1422-9155","authenticated-orcid":false,"given":"Suning","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Xiaoying","family":"Qu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,6]]},"reference":[{"key":"10_CR1","volume-title":"Submodular Functions and Electrical Networks","author":"H Narayanan","year":"1997","unstructured":"Narayanan, H.: Submodular Functions and Electrical Networks. Elsevier, New Brunswick (1997)"},{"key":"10_CR2","volume-title":"Supermodularity and Complementarity","author":"DM Topkis","year":"1998","unstructured":"Topkis, D.M.: Supermodularity and Complementarity. Princeton University Press, Princeton (1998)"},{"key":"10_CR3","volume-title":"Submodular Functions and Optimization","author":"S Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization. Elsevier, Amsterdam (2005)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bernhard Korte, J.V.: Combinatorial Optimization. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-662-56039-6"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10107-006-0084-2","volume":"112","author":"S Iwata","year":"2008","unstructured":"Iwata, S.: Submodular function minimization. Math. Program. 112, 45\u201364 (2008)","journal-title":"Math. Program."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Mathematical Programming The State of the Art: Bonn 1982, pp. 235\u2013257. Springer, Berlin, Heidelberg (1983)","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Harvey, N.J.: Learning submodular functions. Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, pp. 793\u2013802 (2011)","DOI":"10.1145\/1993636.1993741"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1145\/502090.502093","volume":"48","author":"DS Hochbaum","year":"2001","unstructured":"Hochbaum, D.S.: An efficient algorithm for image segmentation, Markov random fields and related problems. J. ACM 48(4), 686\u2013701 (2001)","journal-title":"J. ACM"},{"issue":"4","key":"10_CR9","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 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"10_CR10","first-page":"625","volume":"15","author":"M Seeger","year":"2003","unstructured":"Seeger, M., Herbrich, R.: Fast sparse gaussian process methods: the informative vector machine. Adv. Neural Inf. Process. Syst. 15, 625\u2013632 (2003)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10_CR11","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for sub- set selection, sparse approximation and dictionary selection. arXiv preprint, arXiv:1102.3975 (2011). https:\/\/api.semanticscholar.org\/CorpusID:16480285"},{"issue":"6B","key":"10_CR12","doi-asserted-by":"publisher","first-page":"3539","DOI":"10.1214\/17-AOS1679","volume":"46","author":"ER Elenberg","year":"2018","unstructured":"Elenberg, E.R., Khanna, R., Dimakis, A.G., Negahban, S.: Restricted strong con-vexity implies weak submodularity. Ann. Stat. 46(6B), 3539\u20133568 (2018)","journal-title":"Ann. Stat."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2020.05.018","volume":"853","author":"S Gong","year":"2020","unstructured":"Gong, S., Nong, Q., Sun, T., Fang, Q., Shao, X.: Maximize a monotone function with a generic submodularity ratio. Theor. Comput. Sci. 853, 16\u201324 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR14","unstructured":"Ohsaka, N., Yoshida, Y.: Monotone k-submodular function maximization with size constraints. In: Proceedings of the 28th International Conference on Neural Information Processing Systems, vol. 1, pp. 694\u2013702 (2015)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-32147-4_40","volume-title":"Combinatorial Optimization","author":"A Huber","year":"2012","unstructured":"Huber, A., Kolmogorov, V.: Towards minimizing k-submodular functions. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 451\u2013462. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32147-4_40"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2850419","volume":"12","author":"J Ward","year":"2016","unstructured":"Ward, J., \u017divn\u1ef3, S.: Maximizing k-submodular functions and beyond. ACM Trans. Algorithms 12, 1\u201326 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.disopt.2017.01.003","volume":"23","author":"S Sakaue","year":"2017","unstructured":"Sakaue, S.: On maximizing a monotone k-submodular function subject to a matroid constraint. Discret. Optim. 23, 105\u2013113 (2017)","journal-title":"Discret. Optim."},{"issue":"1","key":"10_CR18","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":"10_CR19","unstructured":"Xiao, H., Liu, Q., Zhou, Y., Li, M.: Approximation algorithms for k-submodular maximization subject to a knapsack constraint. CoRR, ArXiv abs\/2306.14520 (2023). https:\/\/arxiv.org\/abs\/2306.14520"},{"key":"10_CR20","unstructured":"Huang, L., Wang, B., Zhou, H.: On optimal approximations for k-submodular maximization via multilinear extension. arXiv preprint arXiv:2107.07103 (2021). https:\/\/arxiv.org\/abs\/2107.07103"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Zheng, L., Chan, H., Loukides, G., Li, M.: Maximizing approximately k- submodular functions. In: Proceedings of the 2021 SIAM International Conference on Data Mining, pp. 414\u2013422 (2021)","DOI":"10.1137\/1.9781611976700.47"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Wang, Y., Zhang, D., Zhang, Y., Zhang, Z.: Weakly k-submodular maximization under matroid constraint. In: Theory and Applications of Models of Computation, pp. 393\u201340 (2022)","DOI":"10.1007\/978-3-031-20350-3_32"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Jiang, Y., Wang, Y., Yang, R., Ye, W.: Maximizing approximately non-k- submodular monotone set function with matroid constraint. In: International Conference on Theory and Applications of Models of Computation, pp. 11\u201320 (2022)","DOI":"10.1007\/978-3-031-20350-3_2"},{"issue":"3","key":"10_CR24","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1287\/moor.7.3.410","volume":"7","author":"LA Wolsey","year":"1982","unstructured":"Wolsey, L.A.: Maximising real-valued submodular functions: primal and dual heuristics for location problems. Math. Oper. Res. 7(3), 410\u2013425 (1982)","journal-title":"Math. Oper. Res."},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Sahni, S.S.: Approximate algorithms for the 0\u20131 knapsack problem. J. ACM 22, 115\u2013124 (1975)","DOI":"10.1145\/321864.321873"}],"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-4445-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:34:11Z","timestamp":1746437651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4445-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819644445","9789819644452"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4445-2_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":"6 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"}}]}}