{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:13Z","timestamp":1725603673776},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_38","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"445-456","source":"Crossref","is-referenced-by-count":2,"title":["Scope-Based Route Planning"],"prefix":"10.1007","author":[{"given":"Petr","family":"Hlin\u011bn\u00fd","sequence":"first","affiliation":[]},{"given":"Ondrej","family":"Mori\u0161","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20662-7_20","volume-title":"Experimental Algorithms","author":"I. Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 230\u2013241. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway dimension, shortest paths, and provably efficient algorithms. In: SODA 2010: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 782\u2013793 (2010)","key":"38_CR2","DOI":"10.1137\/1.9781611973075.64"},{"doi-asserted-by":"crossref","unstructured":"Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant shortest-path queries in road networks. In: ALENEX 2007: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments, pp. 46\u201359 (2007)","key":"38_CR3","DOI":"10.1137\/1.9781611972870.5"},{"doi-asserted-by":"crossref","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and robust unidirectional routing. J. Exp. Algorithmics\u00a014(4), 2.4\u20134:2.29 (2010)","key":"38_CR4","DOI":"10.1145\/1498698.1537599"},{"doi-asserted-by":"crossref","unstructured":"Brunel, E., Delling, D., Gemsa, A., Wagner, D.: Space-efficient SHARC-routing. In: SEA 2010: Proceedings of the 9th International Symposium on Experimental Algorithms, pp. 47\u201358 (2010)","key":"38_CR5","DOI":"10.1007\/978-3-642-13193-6_5"},{"issue":"2","key":"38_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"B. Cherkassky","year":"1996","unstructured":"Cherkassky, B., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming\u00a073(2), 129\u2013174 (1996)","journal-title":"Mathematical Programming"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D. Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol.\u00a05515, pp. 117\u2013139. Springer, Heidelberg (2009)"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05465-5_8","volume-title":"Robust and Online Large-Scale Optimization","author":"D. Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Time-dependent route planning. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 207\u2013230. Springer, Heidelberg (2009)"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R. Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 319\u2013333. Springer, Heidelberg (2008)"},{"unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A* search meets graph theory. In: SODA 2005: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 156\u2013165 (2005)","key":"38_CR11"},{"doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient point-to-point shortest path algorithms. Technical report, Microsoft Research (2005)","key":"38_CR12","DOI":"10.1137\/1.9781611972863.13"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-540-72845-0_4","volume-title":"Experimental Algorithms","author":"A.V. Goldberg","year":"2007","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Better landmarks within reach. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 38\u201351. Springer, Heidelberg (2007)"},{"unstructured":"Goldberg, A.V., Werneck, R.F.: Computing point-to-point shortest paths from external memory. In: ALENEX\/ANALCO 2005: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments and the 2nd Workshop on Analytic Algorithmics and Combinatorics, pp. 26\u201340 (2005)","key":"38_CR14"},{"unstructured":"Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: ALENEX 2004: Proceedings of the 6th Workshop on Algorithm Engineering and Experiments, pp. 100\u2013111 (2004)","key":"38_CR15"},{"issue":"2","key":"38_CR16","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC4\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics SSC4"},{"doi-asserted-by":"crossref","unstructured":"Hlin\u011bn\u00fd, P., Mori\u0161, O.: Generalized maneuvers in route planning. ArXiv e-prints, arXiv:1107.0798 (July 2011)","key":"38_CR17","DOI":"10.1007\/978-3-642-25929-6_15"},{"unstructured":"Hlin\u011bn\u00fd, P., Mori\u0161, O.: Multi-Stage Improved Route Planning Approach: theoretical foundations. ArXiv e-prints, arXiv:1101.3182 (January 2011)","key":"38_CR18"},{"doi-asserted-by":"crossref","unstructured":"Maue, J., Sanders, P., Matijevic, D.: Goal-directed shortest-path queries using precomputed cluster distances. J. Exp. Algorithmics\u00a014, 3.2\u20133.27 (2009)","key":"38_CR19","DOI":"10.1145\/1498698.1564502"},{"unstructured":"Murdock, S.H.: 2009 TIGER\/Line Shapefiles. Technical Documentation published by U.S. Census Bureau (2009)","key":"38_CR20"},{"doi-asserted-by":"crossref","unstructured":"Pohl, I.S.: Bi-directional and heuristic search in path problems. PhD thesis, Stanford University, Stanford, CA, USA (1969)","key":"38_CR21","DOI":"10.2172\/4785039"},{"key":"38_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1007\/11841036_71","volume-title":"Algorithms \u2013 ESA 2006","author":"P. Sanders","year":"2006","unstructured":"Sanders, P., Schultes, D.: Engineering highway hierarchies. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 804\u2013816. Springer, Heidelberg (2006)"},{"key":"38_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/978-3-540-87744-8_61","volume-title":"Algorithms - ESA 2008","author":"P. Sanders","year":"2008","unstructured":"Sanders, P., Schultes, D., Vetter, C.: Mobile route planning. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 732\u2013743. Springer, Heidelberg (2008)"},{"unstructured":"Schultes, D.: Route Planning in Road Networks. PhD thesis, Karlsruhe University, Karlsruhe, Germany (2008)","key":"38_CR24"},{"key":"38_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-72845-0_6","volume-title":"Experimental Algorithms","author":"D. Schultes","year":"2007","unstructured":"Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 66\u201379. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:08:48Z","timestamp":1560514128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}