{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T03:19:06Z","timestamp":1782789546244,"version":"3.54.5"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319123394","type":"print"},{"value":"9783319123400","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-12340-0_14","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T04:27:23Z","timestamp":1413779243000},"page":"164-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Minimum Spanning Tree Verification Under Uncertainty"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,10,21]]},"reference":[{"issue":"4","key":"14_CR1","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. Theor. Comput. Syst. 38(4), 411\u2013423 (2005)","journal-title":"Theor. Comput. Syst."},{"key":"14_CR2","series-title":"LIPIcs","first-page":"277","volume-title":"STACS","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.) STACS. LIPIcs, vol. 1, pp. 277\u2013288. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2008)"},{"issue":"1","key":"14_CR3","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. J. Algorithms 62(1), 1\u201318 (2007)","journal-title":"J. Algorithms"},{"issue":"2","key":"14_CR4","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)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M Garey","year":"1977","unstructured":"Garey, M., Johnson, D.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"14_CR6","unstructured":"Gupta, M., Sabharwal, Y., Sen, S.: The update complexity of selection and related problems. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). LIPIcs, vol. 13, pp. 325\u2013338. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Kahan, S.: A model for data in motion. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC\u201991), pp. 267\u2013277 (1991)","DOI":"10.1145\/103418.103449"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Kamousi, P., Chan, T.M., Suri, S.: Stochastic minimum spanning trees in Euclidean spaces. In: Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG\u201911), pp. 65\u201374. ACM (2011)","DOI":"10.1145\/1998196.1998206"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12340-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T14:49:47Z","timestamp":1676904587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12340-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319123394","9783319123400"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12340-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}