{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:44Z","timestamp":1742913884373,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_23","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"319-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Set Selection Under Explorable Stochastic Uncertainty via Covering Techniques"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3531-7644","authenticated-orcid":false,"given":"Nicole","family":"Megow","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0555-4806","authenticated-orcid":false,"given":"Jens","family":"Schl\u00f6ter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Agarwal, A., Assadi, S., Khanna, S.: Stochastic submodular cover with limited adaptivity. In: SODA, pp. 323\u2013342. SIAM (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.21","DOI":"10.1137\/1.9781611975482.21"},{"key":"23_CR2","doi-asserted-by":"publisher","unstructured":"Bampis, E., D\u00fcrr, C., Erlebach, T., de Lima, M.S., Megow, N., Schl\u00f6ter, J.: Orienting (hyper)graphs under explorable stochastic uncertainty. In: ESA. LIPIcs, vol. 204, pp. 1\u201318 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.10","DOI":"10.4230\/LIPIcs.ESA.2021.10"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Behnezhad, S., Blum, A., Derakhshan, M.: Stochastic vertex cover with few queries. In: SODA, pp. 1808\u20131846. SIAM (2022)","DOI":"10.1137\/1.9781611977073.73"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1287\/opre.2019.1856","volume":"68","author":"A Blum","year":"2020","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. Oper. Res. 68(1), 16\u201334 (2020)","journal-title":"Oper. Res."},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-004-1180-4","volume":"38","author":"R Bruce","year":"2005","unstructured":"Bruce, R., Hoffmann, M., Krizanc, D., Raman, R.: Efficient update strategies for geometric computing with uncertainty. Theory Comput. Syst. 38(4), 411\u2013423 (2005). https:\/\/doi.org\/10.1007\/s00224-004-1180-4","journal-title":"Theory Comput. Syst."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2021.09.032","volume":"895","author":"S Chaplick","year":"2021","unstructured":"Chaplick, S., Halld\u00f3rsson, M.M., de Lima, M.S., Tonoyan, T.: Query minimization under stochastic uncertainty. Theor. Comput. Sci. 895, 75\u201395 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: STOC, pp. 624\u2013633. ACM (2014)","DOI":"10.1145\/2591796.2591884"},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1287\/moor.7.4.515","volume":"7","author":"G Dobson","year":"1982","unstructured":"Dobson, G.: Worst-case analysis of greedy heuristics for integer programming with nonnegative data. Math. Oper. Res. 7(4), 515\u2013531 (1982)","journal-title":"Math. Oper. Res."},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-12340-0_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Erlebach","year":"2014","unstructured":"Erlebach, T., Hoffmann, M.: Minimum spanning tree verification under uncertainty. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 164\u2013175. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12340-0_14"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2015.11.025","volume":"613","author":"T Erlebach","year":"2016","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: Query-competitive algorithms for cheapest set problems under uncertainty. Theoret. Comput. Sci. 613, 51\u201364 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.11.025","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR12","unstructured":"Erlebach, T., de Lima, M.S., Megow, N., Schl\u00f6ter, J.: Learning-augmented query policies for minimum spanning tree with uncertainty. In: ESA. LIPIcs, vol. 244, pp. 1\u201318. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"2","key":"23_CR13","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/S0097539701395668","volume":"32","author":"T Feder","year":"2003","unstructured":"Feder, T., Motwani, R., Panigrahy, R., Olston, C., Widom, J.: Computing the median with uncertainty. SIAM J. Comput. 32(2), 538\u2013547 (2003). https:\/\/doi.org\/10.1137\/S0097539701395668","journal-title":"SIAM J. Comput."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Ghuge, R., Gupta, A., Nagarajan, V.: The power of adaptivity for stochastic submodular cover. In: ICML. Proceedings of Machine Learning Research, vol. 139, pp. 3702\u20133712. PMLR (2021)","DOI":"10.1287\/opre.2022.2388"},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1002\/rsa.20115","volume":"29","author":"MX Goemans","year":"2006","unstructured":"Goemans, M.X., Vondr\u00e1k, J.: Covering minimum spanning trees of random subgraphs. Random Struct. Algorithms 29(3), 257\u2013276 (2006)","journal-title":"Random Struct. Algorithms"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/11682462_50","volume-title":"LATIN 2006: Theoretical Informatics","author":"M Goemans","year":"2006","unstructured":"Goemans, M., Vondr\u00e1k, J.: Stochastic covering and adaptivity. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 532\u2013543. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11682462_50"},{"key":"23_CR17","doi-asserted-by":"publisher","unstructured":"Halld\u00f3rsson, M.M., de Lima, M.S.: Query-competitive sorting with uncertainty. In: MFCS. LIPIcs, vol. 138, pp. 1\u201315 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.7","DOI":"10.4230\/LIPIcs.MFCS.2019.7"},{"key":"23_CR18","unstructured":"Hoffmann, M., Erlebach, T., Krizanc, D., Mihal\u00e1k, M., Raman, R.: Computing minimum spanning trees with uncertainty. In: STACS. LIPIcs, vol. 1, pp. 277\u2013288. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany (2008). https:\/\/arxiv.org\/abs\/0802.2855"},{"key":"23_CR19","doi-asserted-by":"publisher","unstructured":"Kahan, S.: A model for data in motion. In: STOC, pp. 267\u2013277. ACM (1991). https:\/\/doi.org\/10.1145\/103418.103449","DOI":"10.1145\/103418.103449"},{"key":"23_CR20","doi-asserted-by":"publisher","unstructured":"Kolliopoulos, S.G., Young, N.E.: Tight approximation results for general covering integer programs. In: FOCS, pp. 522\u2013528. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959928","DOI":"10.1109\/SFCS.2001.959928"},{"issue":"4","key":"23_CR21","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.jcss.2005.05.002","volume":"71","author":"SG Kolliopoulos","year":"2005","unstructured":"Kolliopoulos, S.G., Young, N.E.: Approximation algorithms for covering\/packing integer programs. J. Comput. Syst. Sci. 71(4), 495\u2013505 (2005). https:\/\/doi.org\/10.1016\/j.jcss.2005.05.002","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR22","doi-asserted-by":"publisher","unstructured":"Maehara, T., Yamaguchi, Y.: Stochastic packing integer programs with few queries. Math. Programm. 182, 141\u2013174 (2019). https:\/\/doi.org\/10.1007\/s10107-019-01388-x","DOI":"10.1007\/s10107-019-01388-x"},{"issue":"4","key":"23_CR23","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/16M1088375","volume":"46","author":"N Megow","year":"2017","unstructured":"Megow, N., Mei\u00dfner, J., Skutella, M.: Randomization helps computing a minimum spanning tree under uncertainty. SIAM J. Comput. 46(4), 1217\u20131240 (2017). https:\/\/doi.org\/10.1137\/16M1088375","journal-title":"SIAM J. Comput."},{"key":"23_CR24","doi-asserted-by":"publisher","unstructured":"Megow, N., Schl\u00f6ter, J.: Set selection under explorable stochastic uncertainty via covering techniques (2022). https:\/\/doi.org\/10.48550\/ARXIV.2211.01097","DOI":"10.48550\/ARXIV.2211.01097"},{"key":"23_CR25","doi-asserted-by":"publisher","unstructured":"Mei\u00dfner, J.: Uncertainty exploration: algorithms, competitive analysis, and computational experiments, Ph. D. thesis, Technischen Universit\u00e4t Berlin (2018). https:\/\/doi.org\/10.14279\/depositonce-7327","DOI":"10.14279\/depositonce-7327"},{"issue":"2","key":"23_CR26","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/S0097539793260763","volume":"28","author":"S Rajagopalan","year":"1998","unstructured":"Rajagopalan, S., Vazirani, V.V.: Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J. Comput. 28(2), 525\u2013540 (1998)","journal-title":"SIAM J. Comput."},{"key":"23_CR27","doi-asserted-by":"publisher","unstructured":"Shmoys, D.B., Swamy, C.: Stochastic optimization is (almost) as easy as deterministic optimization. In: FOCS, pp. 228\u2013237. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.62","DOI":"10.1109\/FOCS.2004.62"},{"key":"23_CR28","doi-asserted-by":"publisher","unstructured":"Vazirani, V.V.: Approximation algorithms, vol. 1. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-662-04565-7","DOI":"10.1007\/978-3-662-04565-7"},{"issue":"1\u20132","key":"23_CR29","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/rsa.20150","volume":"30","author":"J Vondr\u00e1k","year":"2007","unstructured":"Vondr\u00e1k, J.: Shortest-path metric approximation for random subgraphs. Random Struct. Algorithms 30(1\u20132), 95\u2013104 (2007)","journal-title":"Random Struct. Algorithms"},{"key":"23_CR30","unstructured":"Wang, W., Gupta, A., Williams, J.: Probing to minimize. In: ITCS. LIPIcs, vol. 215, pp. 1\u2013123. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:31:02Z","timestamp":1684701062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madison, WI","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}