{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:11:48Z","timestamp":1774023108336,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":76,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642020933","type":"print"},{"value":"9783642020940","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02094-0_7","type":"book-chapter","created":{"date-parts":[[2009,6,27]],"date-time":"2009-06-27T14:45:07Z","timestamp":1246113907000},"page":"117-139","source":"Crossref","is-referenced-by-count":286,"title":["Engineering Route Planning Algorithms"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Dominik","family":"Schultes","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-68880-8_5","volume-title":"Algorithmic Aspects in Information and Management","author":"C. Barrett","year":"2008","unstructured":"Barrett, C., Bisset, K., Holzer, M., Konjevod, G., Marathe, M.V., Wagner, D.: Engineering Label-Constrained Shortest-Path Algorithms. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol.\u00a05034, pp. 27\u201337. Springer, Heidelberg (2008)"},{"key":"7_CR2","volume-title":"Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book","author":"H. Bast","year":"2008","unstructured":"Bast, H., Funke, S., Matijevic, D.: TRANSIT Ultrafast Shortest-Path Queries with Linear-Time Preprocessing. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear) (accepted for publication)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/1.9781611972870.5","volume-title":"Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007)","author":"H. Bast","year":"2007","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, Philadelphia (2007)"},{"issue":"5824","key":"7_CR4","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":"7_CR5","unstructured":"Batz, G.V., Geisberger, R., Sanders, P.: Time Dependent Contraction Hierarchies - Basic Algorithmic Ideas. Technical report, ITI Sanders, Faculty of Informatics, Universit\u00e4t Karlsruhe (TH) (2008), arXiv:0804.3947v1 [cs.DS]"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/1.9781611972887.2","volume-title":"Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008)","author":"R. Bauer","year":"2008","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. In: Munro, I., Wagner, D. (eds.) Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 13\u201326. SIAM, Philadelphia (2008)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. Submitted to the ACM Journal of Experimental Algorithmics (2008) (full paper)","DOI":"10.1137\/1.9781611972887.2"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-68552-4_23","volume-title":"Experimental Algorithms","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: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 303\u2013318. Springer, Heidelberg (2008)"},{"key":"7_CR9","first-page":"209","volume-title":"Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2007)","author":"R. Bauer","year":"2007","unstructured":"Bauer, R., Delling, D., Wagner, D.: Experimental Study on Speed-Up Techniques for Timetable Information Systems. In: Liebchen, C., Ahuja, R.K., Mesa, J.A. (eds.) Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2007), pp. 209\u2013225. Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany (2007)"},{"key":"7_CR10","unstructured":"Bingmann, T.: Visualisierung sehr gro\u00dfer Graphen. Student Research Project (2006)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Cooke, K., Halsey, E.: The Shortest Route Through a Network with Time-Dependent Intermodal Transit Times. Journal of Mathematical Analysis and Applications\u00a0(14), 493\u2013498 (1966)","DOI":"10.1016\/0022-247X(66)90009-6"},{"key":"7_CR12","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":"7_CR13","unstructured":"Dean, B.C.: Continuous-Time Dynamic Shortest Path Algorithms. Master\u2019s thesis, Massachusetts Institute of Technology (1999)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-87744-8_28","volume-title":"Algorithms - ESA 2008","author":"D. Delling","year":"2008","unstructured":"Delling, D.: Time-Dependent SHARC-Routing. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 332\u2013343. Springer, Heidelberg (2008)"},{"key":"7_CR15","volume-title":"Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book","author":"D. Delling","year":"2008","unstructured":"Delling, D., Holzer, M., M\u00fcller, K., Schulz, F., Wagner, D.: High-Performance Multi-Level Routing. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear) (accepted for publication)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008)","author":"D. Delling","year":"2008","unstructured":"Delling, D., Nannicini, G.: Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008). LNCS. Springer, Heidelberg (2008) (to appear)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway Hierarchies Star. In: Demetrescu, et al. (eds.) [19]","DOI":"10.1090\/dimacs\/074\/06"},{"key":"7_CR18","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":"7_CR19","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): 9th DIMACS Implementation Challenge - Shortest Paths (November 2006)"},{"key":"7_CR20","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":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-68552-4_26","volume-title":"Experimental Algorithms","author":"Y. Disser","year":"2008","unstructured":"Disser, Y., M\u00fcller-Hannemann, M., Schnee, M.: Multi-Criteria Shortest Paths in Time-Dependent Train Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 347\u2013361. Springer, Heidelberg (2008)"},{"issue":"5","key":"7_CR22","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.jcss.2005.05.007","volume":"72","author":"J. Fakcharoenphol","year":"2006","unstructured":"Fakcharoenphol, J., Rao, S.: Planar Graphs, Negative Weight Edges, Shortest Paths, and near Linear Time. Journal of Computer and System Sciences\u00a072(5), 868\u2013889 (2006)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR23","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)"},{"key":"7_CR24","unstructured":"Goldberg, A.: Personal communication (2008)"},{"key":"7_CR25","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: Proceedings of the 16th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 156\u2013165 (2005)"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/1.9781611972863.13","volume-title":"Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006)","author":"A.V. Goldberg","year":"2006","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006), pp. 129\u2013143. SIAM, Philadelphia (2006)"},{"key":"7_CR27","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":"7_CR28","volume-title":"Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book","author":"A.V. Goldberg","year":"2008","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Shortest Path Algorithms with Preprocessing. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear) (accepted for publication)"},{"key":"7_CR29","first-page":"26","volume-title":"Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX 2005)","author":"A.V. Goldberg","year":"2005","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, Philadelphia (2005)"},{"key":"7_CR30","first-page":"243","volume-title":"Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2007)","author":"T. Gunkel","year":"2007","unstructured":"Gunkel, T., M\u00fcller-Hannemann, M., Schnee, M.: Improved Search for Night Train Connections. In: Liebchen, C., Ahuja, R.K., Mesa, J.A. (eds.) Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2007), pp. 243\u2013258. Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany (2007)"},{"key":"7_CR31","first-page":"100","volume-title":"Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX 2004)","author":"R.J. Gutman","year":"2004","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, Philadelphia (2004)"},{"key":"7_CR32","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., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics\u00a04, 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"7_CR33","volume-title":"Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book","author":"M. Hilger","year":"2008","unstructured":"Hilger, M., K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Fast Point-to-Point Shortest Path Computations with Arc-Flags. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear)"},{"key":"7_CR34","unstructured":"Holzer, M.: Engineering Planar-Separator and Shortest-Path Algorithms. Ph.D thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (2008)"},{"key":"7_CR35","volume-title":"Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006)","author":"M. Holzer","year":"2006","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, Philadelphia (2006)"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. ACM Journal of Experimental Algorithmics (2008) (to appear)","DOI":"10.1145\/1412228.1412239"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Holzer, M., Schulz, F., Wagner, D., Willhalm, T.: Combining Speed-up Techniques for Shortest-Path Computations. ACM Journal of Experimental Algorithmics\u00a010 (2006)","DOI":"10.1145\/1064546.1180616"},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-24838-5_20","volume-title":"Experimental and Efficient Algorithms","author":"M. Holzer","year":"2004","unstructured":"Holzer, M., Schulz, F., Willhalm, T.: Combining Speed-up Techniques for Shortest-Path Computations. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 269\u2013284. Springer, Heidelberg (2004)"},{"key":"7_CR39","first-page":"463","volume-title":"Proceedings of the Vehicle Navigation and Information Systems Conference (VNIS 1991)","author":"K. Ishikawa","year":"1991","unstructured":"Ishikawa, K., Ogawa, M., Azuma, M., Ito, T.: Map Navigation Software of the Electro-Multivision of the 91 Toyoto Soarer. In: Proceedings of the Vehicle Navigation and Information Systems Conference (VNIS 1991), pp. 463\u2013473. IEEE Computer Society, Los Alamitos (1991)"},{"issue":"1","key":"7_CR40","first-page":"1","volume":"1","author":"D.E. Kaufman","year":"1993","unstructured":"Kaufman, D.E., Smith, R.L.: Fastest Paths in Time-Dependent Networks for Intelligent Vehicle-Highway Systems Application. Journal of Intelligent Transportation Systems\u00a01(1), 1\u201311 (1993)","journal-title":"Journal of Intelligent Transportation Systems"},{"key":"7_CR41","unstructured":"Klein, P.N.: Multiple-Source Shortest Paths in Planar Graphs. In: Proceedings of the 16th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 146\u2013155 (2005)"},{"key":"7_CR42","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/1.9781611972870.4","volume-title":"Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007)","author":"S. Knopp","year":"2007","unstructured":"Knopp, S., Sanders, P., Schultes, D., Schulz, F., Wagner, D.: Computing Many-to-Many Shortest Paths Using Highway Hierarchies. In: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007), pp. 36\u201345. SIAM, Philadelphia (2007)"},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11427186_13","volume-title":"Experimental and Efficient Algorithms","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: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 126\u2013138. Springer, Heidelberg (2005)"},{"key":"7_CR44","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":"7_CR45","volume-title":"Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book","author":"U. Lauther","year":"2008","unstructured":"Lauther, U.: An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Roadnetworks with Precalculated Edge-Flags. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear)"},{"key":"7_CR46","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. (eds.) WEA 2006. LNCS, vol.\u00a04007, pp. 316\u2013327. Springer, Heidelberg (2006)"},{"key":"7_CR47","unstructured":"Meyer, U.: Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time. In: Proceedings of the 12th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 797\u2013806 (2001)"},{"key":"7_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11427186_18","volume-title":"Experimental and Efficient Algorithms","author":"R.H. M\u00f6hring","year":"2005","unstructured":"M\u00f6hring, R.H., Schilling, H., Sch\u00fctz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speed Up Dijkstra\u2019s Algorithm. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 189\u2013202. Springer, Heidelberg (2005)"},{"key":"7_CR49","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H., Schilling, H., Sch\u00fctz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speedup Dijkstra\u2019s Algorithm. ACM Journal of Experimental Algorithmics\u00a011, 2.8 (2006)","DOI":"10.1145\/1187436.1216585"},{"key":"7_CR50","unstructured":"M\u00fcller, K.: Berechnung k\u00fcrzester Pfade unter Beachtung von Abbiegeverboten. Student Research Project (2005)"},{"key":"7_CR51","unstructured":"M\u00fcller, K.: Design and Implementation of an Efficient Hierarchical Speed-up Technique for Computation of Exact Shortest Paths in Graphs. Master\u2019s thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (June 2006)"},{"key":"7_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-540-75520-3_58","volume-title":"Algorithms \u2013 ESA 2007","author":"L.F. Muller","year":"2007","unstructured":"Muller, L.F., Zachariasen, M.: Fast and Compact Oracles for Approximate Distances in Planar Graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 657\u2013668. Springer, Heidelberg (2007)"},{"key":"7_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-74247-0_13","volume-title":"Algorithmic Methods for Railway Optimization","author":"M. M\u00fcller-Hannemann","year":"2007","unstructured":"M\u00fcller-Hannemann, M., Schnee, M.: Finding All Attractive Train Connections by Multi-Criteria Pareto Search. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol.\u00a04359, pp. 246\u2013263. Springer, Heidelberg (2007)"},{"key":"7_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-74247-0_3","volume-title":"Algorithmic Methods for Railway Optimization","author":"M. M\u00fcller-Hannemann","year":"2007","unstructured":"M\u00fcller-Hannemann, M., Schulz, F., Wagner, D., Zaroliagis, C.: Timetable Information: Models and Algorithms. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol.\u00a04359, pp. 67\u201390. Springer, Heidelberg (2007)"},{"key":"7_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-68552-4_25","volume-title":"Experimental Algorithms","author":"G. Nannicini","year":"2008","unstructured":"Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A* Search for Time-Dependent Fast Paths. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 334\u2013346. Springer, Heidelberg (2008)"},{"issue":"3","key":"7_CR56","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A. Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length. Journal of the ACM\u00a037(3), 607\u2013625 (1990)","journal-title":"Journal of the ACM"},{"key":"7_CR57","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithmics\u00a012, Article 2.4 (2007)","DOI":"10.1145\/1227161.1227166"},{"key":"7_CR58","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":"7_CR59","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":"7_CR60","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":"7_CR61","volume-title":"Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book","author":"P. Sanders","year":"2008","unstructured":"Sanders, P., Schultes, D.: Robust, Almost Constant Time Shortest-Path Queries in Road Networks. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American Mathematical Society, Providence (2008) (to appear) (accepted for publication)"},{"key":"7_CR62","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)"},{"key":"7_CR63","unstructured":"Schilling, H.: Route Assignment Problems in Large Networks. Ph.D thesis, Technische Universit\u00e4t Berlin (2006)"},{"key":"7_CR64","unstructured":"Schultes, D.: Route Planning in Road Networks. Ph.D thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (February 2008)"},{"key":"7_CR65","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":"7_CR66","unstructured":"Schulz, F.: Timetable Information and Shortest Paths. Ph.D thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (2005)"},{"key":"7_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-48318-7_11","volume-title":"Algorithm Engineering","author":"F. Schulz","year":"1999","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra\u2019s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol.\u00a01668, pp. 110\u2013123. Springer, Heidelberg (1999)"},{"key":"7_CR68","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 Journal of Experimental Algorithmics\u00a05 (2000)","DOI":"10.1145\/351827.384254"},{"key":"7_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-45643-0_4","volume-title":"Algorithm Engineering and Experiments","author":"F. Schulz","year":"2002","unstructured":"Schulz, F., Wagner, D., Zaroliagis, C.: Using Multi-Level Graphs for Timetable Information in Railway Systems. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 43\u201359. Springer, Heidelberg (2002)"},{"key":"7_CR70","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/SFCS.2001.959898","volume-title":"Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001)","author":"M. Thorup","year":"2001","unstructured":"Thorup, M.: Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 242\u2013251. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"7_CR71","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Integer Priority Queues with Decrease Key in Constant Time and the Single Source Shortest Paths Problem. In: Proceedings of the 35th Annual ACM Symposium on the Theory of Computing (STOC 2003), June 2003, pp. 149\u2013158 (2003)","DOI":"10.1145\/780542.780566"},{"key":"7_CR72","unstructured":"U.S.\u00a0Census Bureau, Washington, DC. UA Census 2000 TIGER\/Line Files (2002), http:\/\/www.census.gov\/geo\/www\/tiger\/tigerua\/ua_tgr2k.html"},{"key":"7_CR73","unstructured":"Volker, L.: Route planning in road networks with turn costs. Studienarbeit, Universit\u00e4t Karlsruhe, Institut f\u00fcr theoretische Informatik (2008)"},{"key":"7_CR74","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/978-3-540-39658-1_69","volume-title":"Algorithms - ESA 2003","author":"D. Wagner","year":"2003","unstructured":"Wagner, D., Willhalm, T.: Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 776\u2013787. Springer, Heidelberg (2003)"},{"key":"7_CR75","doi-asserted-by":"crossref","unstructured":"Wagner, D., Willhalm, T., Zaroliagis, C.: Geometric Containers for Efficient Shortest-Path Computation. ACM Journal of Experimental Algorithmics\u00a010, 1.3 (2005)","DOI":"10.1145\/1064546.1103378"},{"key":"7_CR76","unstructured":"Willhalm, T.: Engineering Shortest Paths and Layout Algorithms for Large Graphs. Ph.D thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Large and Complex Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02094-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T03:47:18Z","timestamp":1558410438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02094-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020933","9783642020940"],"references-count":76,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02094-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}