{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:13:55Z","timestamp":1742386435033},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412557"},{"type":"electronic","value":"9783540409960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40996-3_5","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:17:32Z","timestamp":1188335852000},"page":"47-59","source":"Crossref","is-referenced-by-count":22,"title":["Online Routing in Convex Subdivisions"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Andrej","family":"Brodnik","sequence":"additional","affiliation":[]},{"given":"Svante","family":"Carlsson","sequence":"additional","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Rudolf","family":"Fleischer","sequence":"additional","affiliation":[]},{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"additional","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]},{"given":"J.Ian","family":"Munro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,29]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF02712872","volume":"16","author":"O. Aichholzer","year":"1996","unstructured":"O. Aichholzer, F. Aurenhammer, S.-W. Cheng, N. Katoh, G. Rote, M. Taschwer, and Y.-F. Xu. Triangulations intersect nicely. Discrete and Computational Geometry, 16(4):339\u2013359, 1996.","journal-title":"Discrete and Computational Geometry"},{"key":"5_CR2","unstructured":"A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"5_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-46632-0_12","volume-title":"Online routing in triangulations","author":"P. Bose","year":"1999","unstructured":"P. Bose and P. Morin. Online routing in triangulations. In Proceedings of the Tenth International Symposium on Algorithms and Computation (ISAAC\u201999), volume 1741 of Springer LNCS, pages 113\u2013122, 1999."},{"key":"5_CR4","unstructured":"P. Bose and P. Morin. Competitive routing algorithms for greedy and minimum-weight triangulations. Manuscript, 2000."},{"issue":"5","key":"5_CR5","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1142\/S0218001496000281","volume":"10","author":"P. Cucka","year":"1996","unstructured":"P. Cucka, N. S. Netanyahu, and A. Rosenfeld. Learning in navigation: Goal finding in graphs. International Journal of Pattern Recognition and Artificial Intelligence, 10(5):429\u2013446, 1996.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R. L. Graham","year":"1972","unstructured":"R. L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1:132\u2013133, 1972.","journal-title":"Information Processing Letters"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(94)90155-4","volume":"130","author":"B. Kalyanasundaram","year":"1994","unstructured":"B. Kalyanasundaram and K. R. Pruhs. Constructing competitive tours from local information. Theoretical Computer Science, 130:125\u2013138, 1994.","journal-title":"Theoretical Computer Science"},{"key":"5_CR8","unstructured":"E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG\u201999), 1999."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C. H. Papadimitriou","year":"1991","unstructured":"C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. Theoretical Computer Science, 84:127\u2013150, 1991.","journal-title":"Theoretical Computer Science"},{"key":"5_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag, New York, 1985."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40996-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T23:47:23Z","timestamp":1550879243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40996-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540412557","9783540409960"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-40996-3_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}