{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:19Z","timestamp":1725558799157},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405436"},{"type":"electronic","value":"9783540450771"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45077-1_23","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T16:53:34Z","timestamp":1277484814000},"page":"246-257","source":"Crossref","is-referenced-by-count":11,"title":["An Improved Approximation Algorithm for Computing Geometric Shortest Paths"],"prefix":"10.1007","author":[{"given":"Lyudmil","family":"Aleksandrov","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1137\/S0097539799352759","volume":"30","author":"K.R. Varadarajan","year":"2000","unstructured":"Varadarajan, K.R., Agarwal, P.K.: Approximating Shortest Paths on Nonconvex Polyhedron. SIAM Jl. Comput.\u00a030(4), 1321\u20131340 (2000)","journal-title":"SIAM Jl. Comput."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00453-001-0111-x","volume":"33","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Har-Peled, S., Karia, M.: Computing approximate shortest paths on convex polytopes. Algorithmica\u00a033, 227\u2013242 (2002)","journal-title":"Algorithmica"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1145\/263867.263869","volume":"44","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., et al.: Approximating Shortest Paths on a Convex Polytope in Three Dimensions. Jl. ACM\u00a044, 567\u2013584 (1997)","journal-title":"Jl. ACM"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BFb0054351","volume-title":"Algorithm Theory - SWAT\u201998","author":"L. Aleksandrov","year":"1998","unstructured":"Aleksandrov, L., Lanthier, M., Maheshwari, A., Sack, J.-R.: An \u03b5-approximation algorithm for weighted shortest paths. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol.\u00a01432, pp. 11\u201322. Springer, Heidelberg (1998)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Approximation Algorithms for Geometric Shortest Path Problems. In: 32nd STOC, pp. 286\u2013295 (2000)","DOI":"10.1145\/335305.335339"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Canny, J., Reif, J.H.: New Lower Bound Techniques for Robot Motion Planning Problems. In: 28th FOCS, pp. 49\u201360 (1987)","DOI":"10.1109\/SFCS.1987.42"},{"key":"#cr-split#-23_CR7.1","doi-asserted-by":"crossref","unstructured":"Chen, J., Han, Y.: Shortest Paths on a Polyhedron. In: 6th SoACM-CG, pp. 360???369 (1990);","DOI":"10.1145\/98524.98601"},{"key":"#cr-split#-23_CR7.2","unstructured":"Appeared in Internat. J. Comput. Geom. Appl., 6, 127???144 (1996)"},{"key":"23_CR8","unstructured":"Hershberger, J., Suri, S.: Practical Methods for Approximating Shortest Paths on a Convex Polytope in \n                    \n                      \n                    \n                    $\\mathcal{R}^3$\n                  . In: 6SODA, pp. 447\u2013456 (1995)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Kapoor, S.: Efficient Computation of Geodesic Shortest Paths. In: 31st STOC (1999)","DOI":"10.1145\/301250.301449"},{"issue":"4","key":"23_CR10","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00453-001-0027-5","volume":"30","author":"M. Lanthier","year":"2001","unstructured":"Lanthier, M., Maheshwari, A., Sack, J.-R.: Approximating Weighted Shortest Paths on Polyhedral Surfaces. Algorithmica\u00a030(4), 527\u2013562 (2001)","journal-title":"Algorithmica"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"J.S.B. Mitchell","year":"1987","unstructured":"Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The Discrete Geodesic Problem. SIAM Jl. Computing\u00a016, 647\u2013668 (1987)","journal-title":"SIAM Jl. Computing"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"Mitchell, J.S.B., Papadimitriou, C.H.: The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision. JACM\u00a038, 18\u201373 (1991)","journal-title":"JACM"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(85)90029-8","volume":"20","author":"C.H. Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: An Algorithm for Shortest Path Motion in Three Dimensions. IPL\u00a020, 259\u2013263 (1985)","journal-title":"IPL"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M. Sharir","year":"1986","unstructured":"Sharir, M., Schorr, A.: On Shortest Paths in Polyhedral Spaces. SIAM J. of Comp.\u00a015, 193\u2013215 (1986)","journal-title":"SIAM J. of Comp."},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-45678-3_15","volume-title":"Algorithms and Computation","author":"Z. Sun","year":"2001","unstructured":"Sun, Z., Reif, J.: BUSHWACK: An approximation algorithm for minimal paths through pseudo-Euclidean spaces. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 160\u2013171. Springer, Heidelberg (2001)"},{"key":"23_CR16","unstructured":"Ziegelmann, M.: Constrained Shortest Paths and Related Problems Ph.D. thesis, Universit\u00e4t des Saarlandes (Max-Planck Institut f\u00fcr Informatik)(2001)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45077-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T23:07:08Z","timestamp":1552604828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45077-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405436","9783540450771"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45077-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}