{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:07Z","timestamp":1780783147569,"version":"3.54.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","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-3-032-27732-9_20","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:20Z","timestamp":1780780460000},"page":"281-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Set Selection with\u00a0Uncertain Weights: Non-Adaptive Queries and\u00a0Thresholds"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8103-5333","authenticated-orcid":false,"given":"Christoph","family":"D\u00fcrr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1728-6936","authenticated-orcid":false,"given":"Arturo","family":"Merino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2219-8401","authenticated-orcid":false,"given":"Jos\u00e9 A.","family":"Soto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2049-6467","authenticated-orcid":false,"given":"Jos\u00e9","family":"Verschae","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Hu, T.C.: The maximum capacity route problem. Oper. Res. 9(6), 898\u2013900 (1961)","DOI":"10.1287\/opre.9.6.898"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Gabow, H.N., Maheshwari, S.N., Osterweil, L.J.: On two problems in the generation of program test paths. IEEE Trans. Softw. Eng. SE-2.3, 227\u2013231 (1976). https:\/\/doi.org\/10.1109\/TSE.1976.233819","DOI":"10.1109\/TSE.1976.233819"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Tarjan, R.E.: Applications of path compression on balanced trees. J. Assoc. Comput. Mach. 26(4), 690\u2013715 (1979). https:\/\/doi.org\/10.1145\/322154.322161","DOI":"10.1145\/322154.322161"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Kahan, S.: A model for data in motion. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing - STOC 1991. The Twenty-Third Annual ACM Symposium, New Orleans, Louisiana, United States: ACM Press, pp. 265\u2013277 (1991). https:\/\/doi.org\/10.1145\/103418.103449","DOI":"10.1145\/103418.103449"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Dixon, B., Rauch, M., Tarjan, R.E.: Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. Comput. 21(6), 1184\u20131192 (1992). https:\/\/doi.org\/10.1137\/0221070","DOI":"10.1137\/0221070"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"King, V.: A simpler minimum spanning tree verification algorithm. Algorithmica 18(2), 263\u2013270 (1997). https:\/\/doi.org\/10.1007\/BF02526037","DOI":"10.1007\/BF02526037"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Chazelle, B.: A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM 47(6), 1028\u20131047 (2000). https:\/\/doi.org\/10.1145\/355541.355562","DOI":"10.1145\/355541.355562"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Feder, T., Motwani, R., Panigrahy, R., Olston, C., Widom, J.: Computing the median with uncertainty. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 602\u2013607. ACM (2000) https:\/\/doi.org\/10.1145\/335305.335386","DOI":"10.1145\/335305.335386"},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Bruce, R., Hoffmann, M., Krizanc, D., Raman, R.: Efficient update strategies for geometric computing with uncertainty. Theor. Comput. Syst. 38(4), 411\u2013423 (2005). https:\/\/doi.org\/10.1007\/s00224-004-1180-4","DOI":"10.1007\/s00224-004-1180-4"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Feder, T., Motwani, R., O\u2019Callaghan, L., Olston, C., Panigrahy, R.: Computing shortest paths with uncertainty. J. Algorithms 62, 1\u201318 (2007). https:\/\/doi.org\/10.1016\/j.jalgor.2004.07.005","DOI":"10.1016\/j.jalgor.2004.07.005"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Erlebach, T., Hoffmann, M., Krizanc, D., Mihal\u00e1k, M., Raman, R.: Computing minimum spanning trees with uncertainty. In: The International Symposium on Theoretical Aspects of Computer Science. IBFI Schloss Dagstuhl, pp. 277\u2013288 (2008). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2008.1358","DOI":"10.4230\/LIPIcs.STACS.2008.1358"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Hagerup, T.: An even simpler linear-time algorithm for verifying minimum spanning trees. In: Graph-Theoretic Concepts in Computer Science, vol. 5911. LNCS, Springer, Berlin, pp. 178\u2013189 (2010). https:\/\/doi.org\/10.1007\/978-3-642-11409-0_16","DOI":"10.1007\/978-3-642-11409-0_16"},{"key":"20_CR13","unstructured":"Erlebach, T., Hoffmann, M.: Query-competitive algorithms for computing with uncertainty. Bull. EATCS 2, 116 (2015)"},{"key":"20_CR14","unstructured":"Ta-Shma, N.: A simple proof of the Isolation Lemma. Electron. Colloquium Comput. Complex. (2015)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Gupta, M., Sabharwal, Y., Sen, S.: The update complexity of selection and related problems. Theor. Comput. Syst. 59(1), 112\u2013132 (2016)","DOI":"10.1007\/s00224-015-9664-y"},{"key":"20_CR16","unstructured":"Focke, J., Megow, N., Mei\u00dfner, J.: Minimum spanning tree under explorable uncertainty in theory and experiments. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 75. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"20_CR17","doi-asserted-by":"publisher","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","DOI":"10.1137\/16M1088375"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Mei\u00dfner, J.: Uncertainty exploration (algorithms, competitive analysis, and computational experiments). PhD thesis. TU Berlin, Germany (2018). https:\/\/doi.org\/10.14279\/DEPOSITONCE-7327","DOI":"10.14279\/DEPOSITONCE-7327"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Levi, R., Magnanti, T., Shaposhnik, Y.: Scheduling with testing. Manage. Sci. 65(2), 776\u2013793 (2019). https:\/\/doi.org\/10.1287\/mnsc.2017.2973","DOI":"10.1287\/mnsc.2017.2973"},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Merino, A.I., Soto, J.A.: The minimum cost query problem on matroids with uncertainty areas. In: The International Colloquium on Automata, Languages, and Programming (ICALP 2019). Ed. by Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi, vol. 132. Leibniz International Proceedings in Informatics (LIPIcs). ISSN: 1868-8969. Dagstuhl, Germany: Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, 83:1\u201383:14 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.83","DOI":"10.4230\/LIPIcs.ICALP.2019.83"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Gong, M., Fan, J., Lin, G., Su, B., Su, Z., Zhang, X.: Multiprocessor scheduling with testing: improved online algorithms and numerical experiments. J. Scheduling 28(5), 513\u2013527 (2025)","DOI":"10.1007\/s10951-025-00850-3"},{"key":"20_CR22","unstructured":"Schl\u00f6ter, J.: On the complexity of knapsack under explorable uncertainty: hardness and algorithms. Technical report, 2507.02657. arXiv (2025)"}],"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-032-27732-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:23Z","timestamp":1780780463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_20","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":"7 June 2026","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":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}