{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:19:06Z","timestamp":1766269146031},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540685487"},{"type":"electronic","value":"9783540685524"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68552-4_23","type":"book-chapter","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T09:06:43Z","timestamp":1211965603000},"page":"303-318","source":"Crossref","is-referenced-by-count":36,"title":["Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Reinhard","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Schieferdecker","sequence":"additional","affiliation":[]},{"given":"Dominik","family":"Schultes","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Holzer, M., Schulz, F., Wagner, D., Willhalm, T.: Combining Speed-up Techniques for Shortest-Path Computations. ACM J. of Exp. Algorithmics\u00a010 (2006)","DOI":"10.1145\/1064546.1180616"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"23_CR3","unstructured":"Schultes, D.: Route Planning in Road Networks. PhD thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (2008)"},{"key":"23_CR4","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1962","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1962)"},{"key":"23_CR5","unstructured":"Gutman, R.J.: Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX 2004), pp. 100\u2013111. SIAM (2004)"},{"key":"23_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":"23_CR7","doi-asserted-by":"crossref","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra\u2019s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM J. of Exp. Algorithmics\u00a05 (2000)","DOI":"10.1145\/351827.384254"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006), SIAM (2006)","DOI":"10.1137\/1.9781611972863.15"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 7th Workshop on Experimental Algorithms (WEA 2008)","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: Proceedings of the 7th Workshop on Experimental Algorithms (WEA 2008). LNCS, Springer, Heidelberg (2008)"},{"key":"23_CR10","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, 566 (2007)","journal-title":"Science"},{"key":"23_CR11","unstructured":"Goldberg, A.V., Werneck, R.F.: Computing Point-to-Point Shortest Paths from External Memory. In: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX 2005), pp. 26\u201340. SIAM (2005)"},{"key":"23_CR12","unstructured":"Lauther, U.: An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In: Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung, vol.\u00a022, pp. 219\u2013230. IfGI prints (2004)"},{"key":"23_CR13","unstructured":"Hilger, M.: Accelerating Point-to-Point Shortest Path Computations in Large Scale Networks. Master\u2019s thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"23_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1064546.1103378","volume":"10","author":"D. Wagner","year":"2005","unstructured":"Wagner, D., Willhalm, T., Zaroliagis, C.: Geometric Containers for Efficient Shortest-Path Computation. ACM J. of Exp. Algorithmics\u00a010, 1.3 (2005)","journal-title":"ACM J. of Exp. Algorithmics"},{"key":"23_CR15","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway Hierarchies Star. In: 9th DIMACS Implementation Challenge - Shortest Paths (2006)"},{"key":"23_CR16","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":"23_CR17","doi-asserted-by":"crossref","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. In: Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 13\u201326. SIAM (2008)","DOI":"10.1137\/1.9781611972887.2"},{"key":"23_CR18","unstructured":"Schieferdecker, D.: Systematic Combination of Speed-Up Techniques for exact Shortest-Path Queries. Master\u2019s thesis, Universit\u00e4t Karlsruhe (TH) (2008)"},{"key":"23_CR19","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: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007), pp. 46\u201359. SIAM (2007)","DOI":"10.1137\/1.9781611972870.5"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72845-0_5","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2007","unstructured":"Delling, D., Wagner, D.: Landmark-Based Routing in Dynamic Graphs. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 52\u201365. Springer, Heidelberg (2007)"},{"key":"23_CR21","unstructured":"Pellegrini, F.: SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partitioning, and Parallel and Sequential Sparse Matrix Ordering Package (2007)"}],"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_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T06:15:31Z","timestamp":1631340931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68552-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540685487","9783540685524"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68552-4_23","relation":{},"subject":[]}}