{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:45:24Z","timestamp":1725551124371},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006237"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-36494-3_5","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T17:12:04Z","timestamp":1269882724000},"page":"38-49","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Geometric Bottleneck Shortest Paths"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giri","family":"Narasimhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"The LCA problem revisited","author":"M. A. Bender","year":"2000","unstructured":"M. A. Bender and M. Farach-Colton. The LCA problem revisited. Proc. 4th LATIN, LNCS, 1776, pp. 88\u201394, 2000."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0020-0190(90)90054-2","volume":"35","author":"M. S. Chang","year":"1990","unstructured":"M. S. Chang, N.-F. Huang, and C.-Y. Tang. An optimal algorithm for constructing oriented Voronoi diagrams and geographic neighborhood graphs. Information Processing Letters, 35:255\u2013260, 1990.","journal-title":"Information Processing Letters"},{"key":"5_CR3","series-title":"Lect Notes Comput Sci","first-page":"151","volume-title":"Efficient algorithms for shortest path queries in planar digraphs","author":"H. N. Djidjev","year":"1996","unstructured":"H. N. Djidjev. Efficient algorithms for shortest path queries in planar digraphs. Proc. 22nd WG, LNCS, 1197, pp. 151\u2013165, 1996."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"D. Eppstein. Spanning trees and spanners. In Handbook of Computational Geometry, pages 425\u2013461. Elsevier, 2000.","DOI":"10.1016\/B978-044482537-7\/50010-3"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J. M. Keil","year":"1992","unstructured":"J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, 7:13\u201328, 1992.","journal-title":"Discrete & Computational Geometry"},{"key":"5_CR6","first-page":"13","volume":"9","author":"G. Narasimhan","year":"2002","unstructured":"G. Narasimhan and M. Smid. Approximation algorithms for the bottleneck stretch factor problem. Nordic Journal of Computing, 9:13\u201331, 2002.","journal-title":"Nordic Journal of Computing"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A. C. Yao","year":"1982","unstructured":"A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11:721\u2013736, 1982.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 2003"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T03:53:05Z","timestamp":1550980385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36494-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540006237"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-36494-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}