{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T15:29:27Z","timestamp":1783438167614,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540685487","type":"print"},{"value":"9783540685524","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68552-4_24","type":"book-chapter","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T09:06:43Z","timestamp":1211965603000},"page":"319-333","source":"Crossref","is-referenced-by-count":370,"title":["Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks"],"prefix":"10.1007","author":[{"given":"Robert","family":"Geisberger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominik","family":"Schultes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-72845-0_2","volume-title":"Experimental Algorithms","author":"P. Sanders","year":"2007","unstructured":"Sanders, P., Schultes, D.: Engineering fast route planning algorithms. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 23\u201336. Springer, Heidelberg (2007)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Schultes, D.: Route Planning in Road Networks. PhD thesis (2008)","DOI":"10.1007\/978-0-387-30162-4_353"},{"key":"24_CR3","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)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/11561071_51","volume-title":"Algorithms \u2013 ESA 2005","author":"P. Sanders","year":"2005","unstructured":"Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 568\u2013579. Springer, Heidelberg (2005)"},{"key":"24_CR5","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":"24_CR6","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)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and robust unidirectional routing. In: Workshop on Algorithm Engineering and Experiments (ALENEX) (2008)","DOI":"10.1137\/1.9781611972887.2"},{"issue":"5824","key":"24_CR8","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H. Bast","year":"2007","unstructured":"Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. Science\u00a0316(5824), 566 (2007)","journal-title":"Science"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-92188-2","volume-title":"WEA 2008","author":"R. Bauer","year":"2008","unstructured":"Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for Dijkstra\u2019s algorithm. In: WEA 2008. LNCS, vol.\u00a05038, Springer, Heidelberg (2008)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Knopp, S., Sanders, P., Schultes, D., Schulz, F., Wagner, D.: Computing many-to-many shortest paths using highway hierarchies. In: Workshop on Algorithm Engineering and Experiments (ALENEX) (2007)","DOI":"10.1137\/1.9781611972870.4"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/11764298_29","volume-title":"Experimental Algorithms","author":"J. Maue","year":"2006","unstructured":"Maue, J., Sanders, P., Matijevic, D.: Goal directed shortest path queries using Precomputed Cluster Distances. In: \u00c0lvarez, C., Serna, M.J. (eds.) WEA 2006. LNCS, vol.\u00a04007, pp. 316\u2013328. Springer, Heidelberg (2006)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: Workshop on Algorithm Engineering and Experiments (ALENEX) (2008)","DOI":"10.1137\/1.9781611972887.9"},{"key":"24_CR13","unstructured":"Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: Workshop on Algorithm Engineering and Experiments (ALENEX)., pp. 100\u2013111 (2004)"},{"key":"24_CR14","first-page":"219","volume-title":"Geoinformation und Mobilit\u00e4t \u2013 von der Forschung zur praktischen Anwendung","author":"U. Lauther","year":"2004","unstructured":"Lauther, U.: An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In: Geoinformation und Mobilit\u00e4t \u2013 von der Forschung zur praktischen Anwendung, vol.\u00a022, pp. 219\u2013230. IfGI prints, Institut f\u00fcr Geoinformatik, M\u00fcnster (2004)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"WEA 2005","author":"E. K\u00f6hler","year":"2005","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Acceleration of shortest path and constrained shortest path computation. In: WEA 2005. LNCS, vol.\u00a03503, Springer, Heidelberg (2005)"},{"key":"24_CR16","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway hierarchies star. In: 9th DIMACS Implementation Challenge [20] (2006)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Better landmarks within reach. In: 9th DIMACS Implementation Challenge [20] (2006)","DOI":"10.1007\/978-3-540-72845-0_4"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schultes, D., Vetter, C.: Mobile Route Planning (2008) in preparation, http:\/\/algo2.iti.uka.de\/schultes\/hwy\/","DOI":"10.1007\/978-3-540-87744-8_61"},{"key":"24_CR19","unstructured":"R Development Core Team: R: A Language and Environment for Statistical Computing (2004), http:\/\/www.r-project.org"},{"key":"24_CR20","unstructured":"9th DIMACS Implementation Challenge: Shortest Paths (2006), http:\/\/www.dis.uniroma1.it\/~challenge9\/"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68552-4_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T12:49:53Z","timestamp":1738241393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68552-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540685487","9783540685524"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68552-4_24","relation":{},"subject":[]}}