{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T14:48:01Z","timestamp":1754146081376,"version":"3.41.2"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031987397","type":"print"},{"value":"9783031987403","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-3-031-98740-3_27","type":"book-chapter","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:44Z","timestamp":1752796124000},"page":"376-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recoverable Robust Cardinality Constrained Maximization with\u00a0Commitment of\u00a0a\u00a0Submodular Function"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7540-7401","authenticated-orcid":false,"given":"Sabine","family":"M\u00fcnch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Raach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2440-4937","authenticated-orcid":false,"given":"Sven","family":"de Vries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"Ageev, A.A., Sviridenko, M.I.: An 0.828-approximation algorithm for the uncapacitated facility location problem. Disc. Appl. Math. 93(2\u20133), 149\u2013156 (1999). https:\/\/doi.org\/10.1016\/S0166-218X(99)00103-1","DOI":"10.1016\/S0166-218X(99)00103-1"},{"key":"27_CR2","unstructured":"Bogunovic, I., Mitrovi\u0107, S., Scarlett, J., Cevher, V.: Robust submodular maximization: a non-uniform partitioning approach. In: Proceedings of the 34th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol.\u00a070, pp. 508\u2013516. PMLR (2017)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.dam.2022.02.005","volume":"313","author":"M Bold","year":"2022","unstructured":"Bold, M., Goerigk, M.: Investigating the recoverable robust single machine scheduling problem under interval uncertainty. Disc. Appl. Math. 313, 99\u2013114 (2022). https:\/\/doi.org\/10.1016\/j.dam.2022.02.005","journal-title":"Disc. Appl. Math."},{"key":"27_CR4","unstructured":"B\u00fcsing, C.: Recoverable Robustness in Combinatorial Optimization. Cuvillier Verlag (2011)"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s13675-018-0107-9","volume":"7","author":"C B\u00fcsing","year":"2019","unstructured":"B\u00fcsing, C., Goderbauer, S., Koster, A.M.C.A., Kutschka, M.: Formulations and algorithms for the recoverable $$\\varGamma $$-robust knapsack problem. EURO J. Comput. Optim. 7(1), 15\u201345 (2019). https:\/\/doi.org\/10.1007\/s13675-018-0107-9","journal-title":"EURO J. Comput. Optim."},{"issue":"8","key":"27_CR6","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G Cornuejols","year":"1977","unstructured":"Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Exceptional paper - location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag. Sci. 23(8), 789\u2013810 (1977). https:\/\/doi.org\/10.1287\/mnsc.23.8.789","journal-title":"Manag. Sci."},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1002\/net.21624","volume":"66","author":"MC Dourado","year":"2015","unstructured":"Dourado, M.C., Meierling, D., Penso, L.D., Rautenbach, D., Protti, F., de Almeida, A.R.: Robust recoverable perfect matchings. Networks 66(3), 210\u2013213 (2015). https:\/\/doi.org\/10.1002\/net.21624","journal-title":"Networks"},{"issue":"4","key":"27_CR8","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). https:\/\/doi.org\/10.1145\/285055.285059","journal-title":"J. ACM"},{"key":"27_CR9","doi-asserted-by":"publisher","unstructured":"Feige, U., Vondr\u00e1k, J.: Approximation algorithms for allocation problems: improving the factor of 1-1\/e. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp. 667\u2013676. IEEE (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.14","DOI":"10.1109\/FOCS.2006.14"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA \u201906, pp. 611\u2013620. Society for Industrial and Applied Mathematics (2006)","DOI":"10.1145\/1109557.1109624"},{"issue":"6","key":"27_CR11","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995). https:\/\/doi.org\/10.1145\/227683.227684","journal-title":"J. ACM"},{"key":"27_CR12","unstructured":"Hommelsheim, F., Megow, N., Muluk, K., Peis, B.: Recoverable robust optimization with commitment. arXiv preprint arXiv:2306.08546 (2023)"},{"issue":"1","key":"27_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s11590-016-1057-x","volume":"11","author":"M Hradovich","year":"2017","unstructured":"Hradovich, M., Kasperski, A., Zieli\u0144ski, P.: The recoverable robust spanning tree problem with interval costs is polynomially solvable. Optim. Lett. 11(1), 17\u201330 (2017). https:\/\/doi.org\/10.1007\/s11590-016-1057-x","journal-title":"Optim. Lett."},{"issue":"1","key":"27_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/net.22255","volume":"85","author":"M Jackiewicz","year":"2025","unstructured":"Jackiewicz, M., Kasperski, A., Zieli\u0144ski, P.: Recoverable robust shortest path problem under interval budgeted uncertainty representations. Networks 85(1), 127\u2013141 (2025). https:\/\/doi.org\/10.1002\/net.22255","journal-title":"Networks"},{"issue":"4","key":"27_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. Theory Comput. 11(4), 105\u2013147 (2015). https:\/\/doi.org\/10.4086\/toc.2015.v011a004","journal-title":"Theory Comput."},{"issue":"12","key":"27_CR16","first-page":"2761","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause, A., McMahan, H.B., Guestrin, C., Gupta, A.: Robust submodular observation selection. J. Mach. Learn. Res. 9(12), 2761\u20132801 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-05465-5_1","volume-title":"Robust and Online Large-Scale Optimization","author":"C Liebchen","year":"2009","unstructured":"Liebchen, C., L\u00fcbbecke, M., M\u00f6hring, R., Stiller, S.: The concept of recoverable robustness, linear programming recovery, and railway applications. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 1\u201327. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05465-5_1"},{"key":"27_CR18","unstructured":"Lin, H., Bilmes, J.: A class of submodular functions for document summarization. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, HLT \u201911, vol. 1, pp. 510\u2013520. Association for Computational Linguistics (2011)"},{"key":"27_CR19","unstructured":"Murota, K.: Discrete Convex Analysis, Monographs on Discrete Mathematics and Applications, vol.\u00a010. Society for Industrial and Applied Mathematics (2003)"},{"issue":"1","key":"27_CR20","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s13160-017-0278-4","volume":"35","author":"K Murota","year":"2018","unstructured":"Murota, K.: A stronger multiple exchange property for $$\\text{ M}^{\\natural }$$-concave functions. Jpn. J. Ind. Appl. Math. 35(1), 411\u2013421 (2018). https:\/\/doi.org\/10.1007\/s13160-017-0278-4","journal-title":"Jpn. J. Ind. Appl. Math."},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s13160-017-0285-5","volume":"35","author":"K Murota","year":"2018","unstructured":"Murota, K., Shioura, A.: Simpler exchange axioms for M-concave functions on generalized polymatroids. Jpn. J. Ind. Appl. Math. 35(1), 235\u2013259 (2018). https:\/\/doi.org\/10.1007\/s13160-017-0285-5","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"27_CR22","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, 265\u2013294 (1978). https:\/\/doi.org\/10.1007\/BF01588971","journal-title":"Math. Program."},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s10107-018-1320-2","volume":"172","author":"JB Orlin","year":"2018","unstructured":"Orlin, J.B., Schulz, A.S., Udwani, R.: Robust monotone submodular function maximization. Math. Program. 172, 505\u2013537 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1320-2","journal-title":"Math. Program."},{"key":"27_CR24","unstructured":"Tschiatschek, S., Iyer, R., Wei, H., Bilmes, J.: Learning mixtures of submodular functions for image collection summarization. In: Proceedings of the 28th International Conference on Neural Information Processing Systems, NIPS\u201914, vol. 1, pp. 1413\u20131421 (2014)"},{"key":"27_CR25","unstructured":"Wei, K., Iyer, R., Bilmes, J.: Submodularity in data subset selection and active learning. In: Proceedings of the 32nd International Conference on Machine Learning. Proceedings of Machine Learning Research, vol.\u00a037, pp. 1954\u20131963. PMLR (2015)"},{"issue":"3","key":"27_CR26","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). https:\/\/doi.org\/10.1287\/moor.7.3.410","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98740-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:47Z","timestamp":1752796127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98740-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031987397","9783031987403"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98740-3_27","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":"18 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bozeman, MT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.montana.edu\/bhz\/iwoca2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}