{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:04Z","timestamp":1725489124573},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540432838"},{"type":"electronic","value":"9783540458418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45841-7_20","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:11:17Z","timestamp":1186906277000},"page":"250-261","source":"Crossref","is-referenced-by-count":8,"title":["Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Langerman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Soss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"20_CR1","unstructured":"P. K. Agarwal, R. Klein, C. Knauer, and M. Sharir. Computing the detour of polygonal curves. Unpublished Manuscript, November 2001."},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley and J. B. Saxe. Decomposable searching problems. I. Static-todynamic transformation. Journal of Algorithms, 1(4):301\u2013358, 1980.","journal-title":"Journal of Algorithms"},{"key":"20_CR3","unstructured":"P. Bose and P. Morin. Competitive online routing in geometric graphs. In Proceedings of the VIII International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), 2001."},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/PL00009478","volume":"22","author":"T. M. Chan","year":"1999","unstructured":"T. M. Chan. Geometric applications of a randomized optimization technique. Discrete & Computational Geometry, 22(4):547\u2013567, 1999.","journal-title":"Discrete & Computational Geometry"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"A. Ebbers-Baumann, R. Klein, E. Langetepe, and A. Lingas. A fast algorithm for approximating the detour of a polygonal chain. In Proceedings of the 9th Annual European Symposium on Algorithms (ESA 2001), pages 321\u2013332, 2001.","DOI":"10.1007\/3-540-44676-1_27"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425\u2013461. Elsevier, 1999.","DOI":"10.1016\/B978-044482537-7\/50010-3"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. J. Fortune","year":"1987","unstructured":"S. J. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153\u2013174, 1987.","journal-title":"Algorithmica"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"C. Icking and R. Klein. Searching for the kernel of a polygon: A competitive strategy. In Proceedings of the 11th Annual Symposium on Computational Geometry, pages 258\u2013266, 1995.","DOI":"10.1145\/220279.220307"},{"key":"20_CR9","first-page":"416","volume":"135","author":"W. A. Johnson","year":"1939","unstructured":"W. A. Johnson and R. F. Mehl. Reaction kinetics in processes of nucleation and growth. Transactions of the Americal Institute of Mining and Metallurgy, 135:416\u2013458, 1939.","journal-title":"Transactions of the Americal Institute of Mining and Metallurgy"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1137\/S0097539799361671","volume":"30","author":"G. Narasimhan","year":"2001","unstructured":"G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM Journal on Computing, 30(3):978\u2013989, 2001.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45841-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:00:25Z","timestamp":1556755225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45841-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432838","9783540458418"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45841-7_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}