{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:23:20Z","timestamp":1743135800146,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031813955"},{"type":"electronic","value":"9783031813962"}],"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-81396-2_7","type":"book-chapter","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T23:14:19Z","timestamp":1739315659000},"page":"89-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for\u00a0k-Scenario Matching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0921-1237","authenticated-orcid":false,"given":"Danny","family":"Blom","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0429-108X","authenticated-orcid":false,"given":"Dylan","family":"Hyatt-Denesik","sequence":"additional","affiliation":[]},{"given":"Afrouz Jabal","family":"Amelia","sequence":"additional","affiliation":[]},{"given":"Bart","family":"Smeulders","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,12]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Assadi, S., Khanna, S., Li, Y.: The stochastic matching problem with (very) few queries. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 43\u201360. ACM (2016)","DOI":"10.1145\/2940716.2940769"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Assadi, S., Khanna, S., Li, Y.: The stochastic matching problem: beating half with a non-adaptive algorithm. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 99\u2013116 (2017)","DOI":"10.1145\/3033274.3085146"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Behnezhad, S., Derakhshan, M., Hajiaghayi, M.T.: Stochastic matching with few queries: (1-$$\\varepsilon $$) approximation. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1111\u20131124 (2020)","DOI":"10.1145\/3357713.3384340"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Behnezhad, S., Reyhani, N.: Almost optimal stochastic weighted matching with few queries. In: Proceedings of the 2018 ACM Conference on Economics and Computation, pp. 235\u2013249 (2018)","DOI":"10.1145\/3219166.3219226"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Blum, A., Dickerson, J.P., Haghtalab, N., Procaccia, A.D., Sandholm, T., Sharma, A.: Ignorance is almost bliss: near-optimal stochastic matching with few queries. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, pp. 325\u2013342 (2015)","DOI":"10.1145\/2764468.2764479"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1287\/ijoc.2020.0986","volume":"33","author":"M Carvalho","year":"2021","unstructured":"Carvalho, M., Klimentova, X., Glorie, K., Viana, A., Constantino, M.: Robust models for the kidney exchange problem. INFORMS J. Comput. 33(3), 861\u2013881 (2021). https:\/\/doi.org\/10.1287\/ijoc.2020.0986","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1007\/s10696-021-09439-2","volume":"34","author":"TC Chan","year":"2022","unstructured":"Chan, T.C., Letourneau, D., Potter, B.G.: Sparse flexible design: a machine learning approach. Flex. Serv. Manuf. J. 34(4), 1066\u20131116 (2022)","journal-title":"Flex. Serv. Manuf. J."},{"issue":"5","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1287\/opre.1110.0987","volume":"59","author":"MC Chou","year":"2011","unstructured":"Chou, M.C., Chua, G.A., Teo, C.P., Zheng, H.: Process flexibility revisited: the graph expander and its applications. Oper. Res. 59(5), 1090\u20131105 (2011)","journal-title":"Oper. Res."},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1287\/opre.2022.2408","volume":"71","author":"L DeValve","year":"2023","unstructured":"DeValve, L., Peke\u010d, S., Wei, Y.: Approximate submodularity in network design problems. Oper. Res. 71(4), 1021\u20131039 (2023)","journal-title":"Oper. Res."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Failure-aware kidney exchange. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, pp. 323\u2013340 (2013)","DOI":"10.1145\/2492002.2482596"},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1287\/mnsc.41.4.577","volume":"41","author":"WC Jordan","year":"1995","unstructured":"Jordan, W.C., Graves, S.C.: Principles on the benefits of manufacturing process flexibility. Manage. Sci. 41(4), 577\u2013594 (1995)","journal-title":"Manage. Sci."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-019-01388-x","volume":"182","author":"T Maehara","year":"2020","unstructured":"Maehara, T., Yamaguchi, Y.: Stochastic packing integer programs with few queries. Math. Program. 182, 141\u2013174 (2020)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"7_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0166-218X(99)00052-9","volume":"92","author":"J Plesnik","year":"1999","unstructured":"Plesnik, J.: Constrained weighted matchings and edge coverings in graphs. Discret. Appl. Math. 92(2\u20133), 229\u2013241 (1999)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1287\/opre.2014.1334","volume":"63","author":"D Simchi-Levi","year":"2015","unstructured":"Simchi-Levi, D., Wei, Y.: Worst-case analysis of process flexibility designs. Oper. Res. 63(1), 166\u2013185 (2015)","journal-title":"Oper. Res."},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1287\/ijoc.2021.1099","volume":"34","author":"B Smeulders","year":"2022","unstructured":"Smeulders, B., Bartier, V., Crama, Y., Spieksma, F.C.: Recourse in kidney exchange programs. INFORMS J. Comput. 34(2), 1191\u20131206 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1287\/msom.2020.0913","volume":"24","author":"S Wang","year":"2022","unstructured":"Wang, S., Wang, X., Zhang, J.: Robust optimization approach to process flexibility designs with contribution margin differentials. Manuf. Serv. Oper. Manage. 24(1), 632\u2013646 (2022)","journal-title":"Manuf. Serv. Oper. Manage."},{"issue":"7","key":"7_CR17","doi-asserted-by":"publisher","first-page":"3421","DOI":"10.1287\/mnsc.2017.2761","volume":"64","author":"Z Yan","year":"2018","unstructured":"Yan, Z., Gao, S.Y., Teo, C.P.: On the design of sparse but efficient structures in operations. Manage. Sci. 64(7), 3421\u20133445 (2018)","journal-title":"Manage. Sci."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81396-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T23:14:23Z","timestamp":1739315663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81396-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031813955","9783031813962"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81396-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"12 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"4 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2024\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}