{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T22:33:50Z","timestamp":1772490830397,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T00:00:00Z","timestamp":1594339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T00:00:00Z","timestamp":1594339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006188","name":"Einstein Foundation Berlin","doi-asserted-by":"crossref","award":["Matheon"],"award-info":[{"award-number":["Matheon"]}],"id":[{"id":"10.13039\/501100006188","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["ME 3825\/1"],"award-info":[{"award-number":["ME 3825\/1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005067","name":"Bayerisch-Franz\u00f6sisches Hochschulzentrum","doi-asserted-by":"publisher","award":["Query complexity meets optimization under uncertain input"],"award-info":[{"award-number":["Query complexity meets optimization under uncertain input"]}],"id":[{"id":"10.13039\/501100005067","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-CE25-0008"],"award-info":[{"award-number":["ANR-18-CE25-0008"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s00453-020-00742-2","type":"journal-article","created":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T11:03:03Z","timestamp":1594378983000},"page":"3630-3675","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["An Adversarial Model for Scheduling with Testing"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8103-5333","authenticated-orcid":false,"given":"Christoph","family":"D\u00fcrr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4470-5868","authenticated-orcid":false,"given":"Thomas","family":"Erlebach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3531-7644","authenticated-orcid":false,"given":"Nicole","family":"Megow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julie","family":"Mei\u00dfner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,10]]},"reference":[{"issue":"3","key":"742_CR1","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1287\/moor.2015.0766","volume":"41","author":"M Adamczyk","year":"2016","unstructured":"Adamczyk, M., Sviridenko, M., Ward, J.: Submodular stochastic probing on matroids. Math. Oper. Res. 41(3), 1022\u20131038 (2016)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"742_CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1287\/mnsc.1120.1576","volume":"59","author":"S Alizamir","year":"2013","unstructured":"Alizamir, S., de V\u00e9ricourt, F., Sun, P.: Diagnostic accuracy under congestion. Manag. Sci. 59(1), 157\u2013171 (2013)","journal-title":"Manag. Sci."},{"issue":"3","key":"742_CR3","first-page":"16:1","volume":"7","author":"S Assadi","year":"2019","unstructured":"Assadi, S., Khanna, S., Li, Y.: The stochastic matching problem with (very) few queries. ACM Trans. Econom. Comput. 7(3), 16:1\u201316:19 (2019)","journal-title":"ACM Trans. Econom. Comput."},{"issue":"4","key":"742_CR4","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1007\/s00453-011-9511-8","volume":"63","author":"N Bansal","year":"2012","unstructured":"Bansal, N., Gupta, A., Li, J., Mestre, J., Nagarajan, V., Rudra, A.: When LP is the cure for your matching woes: improved bounds for stochastic matchings. Algorithmica 63(4), 733\u2013762 (2012)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"742_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-015-0927-9","volume":"154","author":"N Bansal","year":"2015","unstructured":"Bansal, N., Nagarajan, V.: On the adaptivity gap of stochastic orienteering. Math. Program. 154(1\u20132), 145\u2013172 (2015)","journal-title":"Math. Program."},{"key":"742_CR6","doi-asserted-by":"crossref","unstructured":"Behnezhad, S., Farhadi, A., Hajiaghayi, M., Reyhani, N.: Stochastic matching with few queries: new algorithms and tools. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2855\u20132874. SIAM (2019)","DOI":"10.1137\/1.9781611975482.177"},{"issue":"1","key":"742_CR7","doi-asserted-by":"crossref","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."},{"key":"742_CR8","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"742_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000024","volume":"5","author":"S Bubeck","year":"2012","unstructured":"Bubeck, S., Cesa-Bianchi, N.: Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Found. Trends Mach. Learn. 5(1), 1\u2013122 (2012)","journal-title":"Found. Trends Mach. Learn."},{"key":"742_CR10","doi-asserted-by":"crossref","unstructured":"Cardoso, J.M.P., de Figueiredo\u00a0Coutinho, J.G., Diniz, P.C.: Embedded Computing for High Performance: Efficient Mapping of Computations Using Customization, Code Transformations and Compilation. Morgan Kaufmann, Burlington (2017)","DOI":"10.1016\/B978-0-12-804189-5.00005-3"},{"key":"742_CR11","doi-asserted-by":"crossref","unstructured":"Chen, N., Immorlica, N., Karlin, A.R., Mahdian, M., Rudra, A.: Approximating matches made in heaven. In: 36th International Colloquium on Automata, Languages, and Programming (ICALP), volume 5555 of Lecture Notes in Computer Science, pp. 266\u2013278. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02927-1_23"},{"issue":"1","key":"742_CR12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10107-005-0588-1","volume":"106","author":"C-FM Chou","year":"2006","unstructured":"Chou, C.-F.M., Queyranne, M., Simchi-Levi, D.: The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates. Math. Program. 106(1), 137\u2013157 (2006)","journal-title":"Math. Program."},{"issue":"4","key":"742_CR13","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1287\/moor.1080.0330","volume":"33","author":"BC Dean","year":"2008","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Approximating the stochastic knapsack problem: the benefit of adaptivity. Math. Oper. Res. 33(4), 945\u2013964 (2008)","journal-title":"Math. Oper. Res."},{"issue":"3\u20134","key":"742_CR14","first-page":"201","volume":"3","author":"E Demeulemeester","year":"2010","unstructured":"Demeulemeester, E., Herroelen, W.: Robust project scheduling. Found. Trends Technol. Inf. Oper. Manag. 3(3\u20134), 201\u2013376 (2010)","journal-title":"Found. Trends Technol. Inf. Oper. Manag."},{"issue":"4","key":"742_CR15","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1137\/S0895480102408341","volume":"16","author":"I Dumitriu","year":"2003","unstructured":"Dumitriu, I., Tetali, P., Winkler, P.: On playing golf with two balls. SIAM J. Discret. Math. 16(4), 604\u2013615 (2003)","journal-title":"SIAM J. Discret. Math."},{"key":"742_CR16","unstructured":"D\u00fcrr, C., Erlebach, T., Megow, N., Mei\u00dfner, J.: Scheduling with explorable uncertainty. In: Karlin, A.R. (ed), 9th Innovations in Theoretical Computer Science Conference (ITCS), volume\u00a094 of LIPIcs, pp. 30:1\u201330:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"742_CR17","unstructured":"Erlebach, T., Hoffmann, M., Krizanc, D., Mihal\u00e1k, M., Raman, R.: Computing minimum spanning trees with uncertainty. In: Albers, S., Weil, P. (eds.) 25th International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol. 1, pp. 277\u2013288. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Germany (2008)"},{"issue":"1","key":"742_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jalgor.2004.07.005","volume":"62","author":"T Feder","year":"2007","unstructured":"Feder, T., Motwani, R., O\u2019Callaghan, L., Olston, C., Panigrahy, R.: Computing shortest paths with uncertainty. J. Algorithms 62(1), 1\u201318 (2007)","journal-title":"J. Algorithms"},{"issue":"2","key":"742_CR19","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"742_CR20","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1002\/rsa.20679","volume":"49","author":"A Ferber","year":"2016","unstructured":"Ferber, A., Krivelevich, M., Sudakov, B., Vieira, P.: Finding hamilton cycles in random graphs with few queries. Random Struct. Algorithms 49(4), 635\u2013668 (2016)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"742_CR21","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/rsa.20680","volume":"50","author":"A Ferber","year":"2017","unstructured":"Ferber, A., Krivelevich, M., Sudakov, B., Vieira, P.: Finding paths in sparse random graphs requires many queries. Random Struct. Algorithms 50(1), 71\u201385 (2017)","journal-title":"Random Struct. Algorithms"},{"key":"742_CR22","doi-asserted-by":"crossref","unstructured":"Fiat, A., Woeginger, G.J. (eds). Online Algorithms: The State of the Art, volume 1442 of LNCS. Springer, Berlin (1998)","DOI":"10.1007\/BFb0029561"},{"key":"742_CR23","unstructured":"Focke, J., Megow, N., Mei\u00dfner, J.: Minimum spanning tree under explorable uncertainty in theory and experiments. In: 16th International Symposium on Experimental Algorithms (SEA), volume\u00a075 of LIPIcs, pp. 22:1\u201322:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"742_CR24","doi-asserted-by":"crossref","DOI":"10.1002\/9780470980033","volume-title":"Multi-armed Bandit Allocation Indices","author":"J Gittins","year":"2011","unstructured":"Gittins, J., Glazebrook, K., Weber, R.: Multi-armed Bandit Allocation Indices, 2nd edn. Wiley, London (2011)","edition":"2"},{"key":"742_CR25","unstructured":"Gittins, J.C.: A dynamic allocation index for the sequential design of experiments. In: Progress in Statistics, pp. 241\u2013266 (1974)"},{"key":"742_CR26","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2014.09.010","volume":"55","author":"M Goerigk","year":"2015","unstructured":"Goerigk, M., Gupta, M., Ide, J., Sch\u00f6bel, A., Sen, S.: The robust knapsack problem with queries. Comput. OR 55, 12\u201322 (2015)","journal-title":"Comput. OR"},{"key":"742_CR27","doi-asserted-by":"crossref","unstructured":"Gupta, A., Jiang, H., Scully, Z., Singla, S.: The Markovian price of information. In: International Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 11480 of Lecture Notes in Computer Science, pp. 233\u2013246. Springer, Berlin (2019)","DOI":"10.1007\/978-3-030-17953-3_18"},{"issue":"1","key":"742_CR28","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/moor.2014.0656","volume":"40","author":"A Gupta","year":"2015","unstructured":"Gupta, A., Krishnaswamy, R., Nagarajan, V., Ravi, R.: Running errands in time: approximation algorithms for stochastic orienteering. Math. Oper. Res. 40(1), 56\u201379 (2015)","journal-title":"Math. Oper. Res."},{"key":"742_CR29","doi-asserted-by":"crossref","unstructured":"Gupta, A., Nagarajan, V.: A stochastic probing problem with applications. In: International Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 7801 of Lecture Notes in Computer Science, pp. 205\u2013216. Springer, Berlin(2013)","DOI":"10.1007\/978-3-642-36694-9_18"},{"key":"742_CR30","doi-asserted-by":"crossref","unstructured":"Gupta, A., Nagarajan, V., Singla, S.: Algorithms and adaptivity gaps for stochastic probing. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp. 1731\u20131747. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch120"},{"issue":"1","key":"742_CR31","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/s00224-015-9664-y","volume":"59","author":"M Gupta","year":"2016","unstructured":"Gupta, M., Sabharwal, Y., Sen, S.: The update complexity of selection and related problems. Theory Comput. Syst. 59(1), 112\u2013132 (2016)","journal-title":"Theory Comput. Syst."},{"key":"742_CR32","doi-asserted-by":"crossref","unstructured":"Kahan, S.: A model for data in motion. In: 23rd Annual ACM Symposium on Theory of Computing (STOC), pp. 267\u2013277 (1991)","DOI":"10.1145\/103418.103449"},{"issue":"5","key":"742_CR33","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10951-019-00599-6","volume":"22","author":"A Kasperski","year":"2019","unstructured":"Kasperski, A., Zieli\u0144ski, P.: Risk-averse single machine scheduling: complexity and approximation. J. Sched. 22(5), 567\u2013580 (2019)","journal-title":"J. Sched."},{"issue":"1","key":"742_CR34","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1162\/evco_a_00242","volume":"27","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evolut. Comput. 27(1), 3\u201345 (2019)","journal-title":"Evolut. Comput."},{"key":"742_CR35","doi-asserted-by":"crossref","unstructured":"Khanna, S., Tan, W.-C.: On computing functions with uncertainty. In: 20th Symposium on Principles of Database Systems (PODS), pp. 171\u2013182 (2001)","DOI":"10.1145\/375551.375577"},{"key":"742_CR36","doi-asserted-by":"crossref","unstructured":"Kleinberg, R.D., Waggoner, B., Weyl, E.G.: Descending price optimally coordinates search. In: Proceedings of the ACM Conference on Economics and Computation (EC), pp. 23\u201324. ACM (2016)","DOI":"10.2139\/ssrn.2810329"},{"key":"742_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimization and Its Applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications. Springer, Berlin (1997)"},{"key":"742_CR38","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"JY-T Leung","year":"2004","unstructured":"Leung, J.Y.-T.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman & Hall\/CRC, London (2004)"},{"issue":"2","key":"742_CR39","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1287\/mnsc.2017.2973","volume":"65","author":"R Levi","year":"2019","unstructured":"Levi, R., Magnanti, T.L., Shaposhnik, Y.: Scheduling with testing. Manag. Sci. 65(2), 776\u2013793 (2019)","journal-title":"Manag. Sci."},{"issue":"3","key":"742_CR40","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/moor.2017.0884","volume":"43","author":"W Ma","year":"2018","unstructured":"Ma, W.: Improvements and generalizations of stochastic knapsack and markovian bandits approximation algorithms. Math. Oper. Res. 43(3), 789\u2013812 (2018)","journal-title":"Math. Oper. Res."},{"key":"742_CR41","doi-asserted-by":"crossref","unstructured":"Maehara, T., Yamaguchi, Y.: Stochastic packing integer programs with few queries. Math. Program. 1\u201334 (2019)","DOI":"10.1007\/s10107-019-01388-x"},{"key":"742_CR42","doi-asserted-by":"crossref","unstructured":"Marb\u00e1n, S., Rutten, C., Vredeveld, T.: Learning in stochastic machine scheduling. In: 9th International Workshop on Approximation and Online Algorithms (WAOA), volume 7164 of Lecture Notes in Computer Science, pp. 21\u201334. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-29116-6_3"},{"issue":"4","key":"742_CR43","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"742_CR44","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.1060.0201","volume":"31","author":"N Megow","year":"2006","unstructured":"Megow, N., Uetz, M., Vredeveld, T.: Models and algorithms for stochastic online scheduling. Math. Oper. Res. 31(3), 513\u2013525 (2006)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"742_CR45","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1287\/moor.2014.0653","volume":"39","author":"N Megow","year":"2014","unstructured":"Megow, N., Vredeveld, T.: A tight 2-approximation for preemptive stochastic scheduling. Math. Oper. Res. 39(4), 1297\u20131310 (2014)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"742_CR46","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/msom.1120.0426","volume":"15","author":"AF Mills","year":"2013","unstructured":"Mills, A.F., Argon, N.T., Ziya, S.: Resource-based patient prioritization in mass-casualty incidents. Manuf. Serv. Oper. Manag. 15(3), 361\u2013377 (2013)","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"742_CR47","first-page":"193","volume":"28","author":"R M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R., Radermacher, F., Weiss, G.: Stochastic scheduling problems I: General strategies. Zeitschrift f\u00fcr Oper. Res. 28, 193\u2013260 (1984)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"key":"742_CR48","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1145\/331524.331530","volume":"46","author":"R M\u00f6hring","year":"1999","unstructured":"M\u00f6hring, R., Schulz, A., Uetz, M.: Approximation in stochastic scheduling: the power of LP-based priority policies. J. ACM 46, 924\u2013942 (1999)","journal-title":"J. ACM"},{"key":"742_CR49","doi-asserted-by":"crossref","unstructured":"Nicolai, R.P., Dekker, R.: Optimal Maintenance of Multi-component Systems: A Review, pp. 263\u2013286. Springer, London (2008)","DOI":"10.1007\/978-1-84800-011-7_11"},{"key":"742_CR50","unstructured":"Olston, C., Widom, J.: Offering a precision-performance tradeoff for aggregation queries over replicated data. In: 26th International Conference on Very Large Data Bases (VLDB), pp. 144\u2013155 (2000)"},{"issue":"3","key":"742_CR51","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/nav.3800230302","volume":"23","author":"WP Pierskalla","year":"1976","unstructured":"Pierskalla, W.P., Voelker, J.A.: A survey of maintenance models: the control and surveillance of deteriorating systems. Naval Res. Logist. 23(3), 353\u2013388 (1976)","journal-title":"Naval Res. Logist."},{"key":"742_CR52","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M Pinedo","year":"2016","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 5th edn. Springer, Berlin (2016)","edition":"5"},{"key":"742_CR53","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis, chapter 15","author":"K Pruhs","year":"2004","unstructured":"Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, chapter 15. Chapman & Hall\/CRC, London (2004)"},{"key":"742_CR54","unstructured":"Rothstein, J.A.: Adaptive compression, July\u00a030 2013. US Patent 8,499,100"},{"key":"742_CR55","unstructured":"Shaposhnik, Y.: Exploration vs. Exploitation: Reducing Uncertainty in Operational Problems. PhD thesis, Sloan School of Management, MIT (2016)"},{"key":"742_CR56","doi-asserted-by":"crossref","unstructured":"Singla, S.: The price of information in combinatorial optimization. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2523\u20132532. SIAM (2018)","DOI":"10.1137\/1.9781611975031.161"},{"issue":"3\/4","key":"742_CR57","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2307\/2332286","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson, W.R.: On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3\/4), 285\u2013294 (1933)","journal-title":"Biometrika"},{"issue":"3","key":"742_CR58","doi-asserted-by":"crossref","first-page":"641","DOI":"10.2307\/1910412","volume":"47","author":"M Weitzman","year":"1979","unstructured":"Weitzman, M.: Optimal search for the best alternative. Econometrica 47(3), 641\u201354 (1979)","journal-title":"Econometrica"},{"issue":"3","key":"742_CR59","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/1075395.1075396","volume":"39","author":"Y Wiseman","year":"2005","unstructured":"Wiseman, Y., Schwan, K., Widener, P.: Efficient end to end data exchange using configurable compression. ACM SIGOPS Oper. Syst. Rev. 39(3), 4\u201323 (2005)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"742_CR60","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: toward a unified measure of complexity. In: 18th Annual Symposium on Foundations of Computer Science (FOCS), pp. 222\u2013227. IEEE (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00742-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00742-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00742-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T00:16:05Z","timestamp":1625876165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00742-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,10]]},"references-count":60,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["742"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00742-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,10]]},"assertion":[{"value":"3 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}