{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:31:01Z","timestamp":1725798661867},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_23","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"263-274","source":"Crossref","is-referenced-by-count":1,"title":["Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Kammer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"H. Aissi","year":"2009","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Min-max and min-max regret versions of combinatorial optimization problems: A survey. European Journal of Operational Research\u00a0197(2), 427\u2013438 (2009)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"23_CR2","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 of Computing Systems\u00a038(4), 411\u2013423 (2005)","journal-title":"Theory of Computing Systems"},{"key":"23_CR3","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. John Wiley and Sons, New York (1998)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-38016-7_9","volume-title":"Approximation and Online Algorithms","author":"R. Dorrigiv","year":"2013","unstructured":"Dorrigiv, R., Fraser, R., He, M., Kamali, S., Kawamura, A., L\u00f3pez-Ortiz, A., Seco, D.: On minimum-and maximum-weight minimum spanning trees with neighborhoods. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol.\u00a07846, pp. 93\u2013106. Springer, Heidelberg (2013)"},{"key":"23_CR5","series-title":"LIPIcs","first-page":"277","volume-title":"25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008)","author":"T. Erlebach","year":"2008","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 2008). LIPIcs, vol.\u00a01, pp. 277\u2013288. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany (2008)"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","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. Journal of Algorithms\u00a062(1), 1\u201318 (2007)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"23_CR7","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(2), 538\u2013547 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica\u00a018(1), 3\u201320 (1997)","journal-title":"Algorithmica"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Kahan, S.: A model for data in motion. In: 23rd Annual ACM Symposium on Theory of Computing (STOC 1991), pp. 267\u2013277 (1991)","DOI":"10.1145\/103418.103449"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Khanna, S., Tan, W.C.: On computing functions with uncertainty. In: 20th Symposium on Principles of Database Systems (PODS 2001), pp. 171\u2013182 (2001)","DOI":"10.1145\/375551.375577"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Lindstr\u00f6m, B.: A theorem on families of sets. Journal of Combinatorial Theory (A) 13, 274\u2013277 (1970)","DOI":"10.1016\/0097-3165(72)90030-1"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11785293_35","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"M. L\u00f6ffler","year":"2006","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest and smallest tours and convex hulls for imprecise points. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 375\u2013387. Springer, Heidelberg (2006)"},{"key":"23_CR13","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 2000), pp. 144\u2013155 (2000)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:06:23Z","timestamp":1558969583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}