{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:55:45Z","timestamp":1725828945982},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_73","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T21:40:34Z","timestamp":1441057234000},"page":"878-890","source":"Crossref","is-referenced-by-count":3,"title":["Randomization Helps Computing a Minimum Spanning Tree under Uncertainty"],"prefix":"10.1007","author":[{"given":"Nicole","family":"Megow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julie","family":"Mei\u00dfner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"73_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.S.: Robust Optimization. Princeton Series in Applied Mathematics. Princeton University Press (2009)","DOI":"10.1515\/9781400831050"},{"key":"73_CR2","series-title":"Springer Series in Operations Research","volume-title":"Introduction to Stochastic Programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer Series in Operations Research. Springer, Heidelberg (1997)"},{"key":"73_CR3","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"key":"73_CR4","unstructured":"Erlebach, T.: Computing with uncertainty. Invited lecture, Graduate Program MDS, Berlin (2013)"},{"key":"73_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a08747, pp. 164\u2013175. Springer, Heidelberg (2014)"},{"key":"73_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/978-3-662-44465-8_23","volume-title":"Mathematical Foundations of Computer Science 2014","author":"T. Erlebach","year":"2014","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: Query-competitive algorithms for cheapest set problems under uncertainty. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol.\u00a08635, pp. 263\u2013274. Springer, Heidelberg (2014)"},{"key":"73_CR7","unstructured":"Erlebach, T., Hoffmann, M., Krizanc, D., Mihal\u00e1k, M., Raman, R.: Computing minimum spanning trees with uncertainty. In: Proc. STACS, pp. 277\u2013288 (2008)"},{"key":"73_CR8","doi-asserted-by":"crossref","unstructured":"Feder, T., Motwani, R., O\u2019Callaghan, L., Olston, C., Panigrahy, R.: Computing shortest paths with uncertainty. Journal of Algorithms 62, 1\u201318 (2007)","DOI":"10.1016\/j.jalgor.2004.07.005"},{"key":"73_CR9","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 Journal on Computing\u00a032, 538\u2013547 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"73_CR10","doi-asserted-by":"publisher","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. Computers & OR\u00a055, 12\u201322 (2015)","journal-title":"Computers & OR"},{"key":"73_CR11","unstructured":"Gupta, M., Sabharwal, Y., Sen, S.: The update complexity of selection and related problems. In: Proc. of FSTTCS. LIPIcs, vol.\u00a013, pp. 325\u2013338 (2011)"},{"key":"73_CR12","doi-asserted-by":"crossref","unstructured":"Kahan, S.: A model for data in motion. In: Proc. of STOC, pp. 267\u2013277 (1991)","DOI":"10.1145\/103418.103449"},{"key":"73_CR13","doi-asserted-by":"crossref","unstructured":"Khanna, S., Tan, W.C.: On computing functions with uncertainty. In: Proceedings of PODS, pp. 171\u2013182 (2001)","DOI":"10.1145\/375551.375577"},{"key":"73_CR14","doi-asserted-by":"crossref","unstructured":"Korte, B., Vygen, J.: Combinatorial optimization. Springer (2012)","DOI":"10.1007\/978-3-642-24488-9"},{"key":"73_CR15","unstructured":"Olston, C., Widom, J.: Offering a precision-performance tradeoff for aggregation queries over replicated data. In: Proceedings of VLDB, pp. 144\u2013155 (2000)"},{"key":"73_CR16","first-page":"303","volume":"2","author":"P. Patil","year":"2012","unstructured":"Patil, P., Shrotri, A.P., Dandekar, A.R.: Management of uncertainty in supply chain. Int. J. of Emerging Technology and Advanced Engineering\u00a02, 303\u2013308 (2012)","journal-title":"Int. J. of Emerging Technology and Advanced Engineering"},{"key":"73_CR17","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wong, S.C.-W.: Two-sided online bipartite matching and vertex cover: Beating the greedy algorithm. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol.\u00a09134, pp. 1070\u20131081. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-47672-7_87"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T16:09:23Z","timestamp":1559232563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}