The DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index.
Engineering Route Planning Algorithms
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Jacob, M. (1989) · Health Education Journal · doi:10.1177/001789698904800401 · Cited by 3,090
Linear Programming and Extensions
Dantzig, G. (1963) · Princeton University Press eBooks · doi:10.1515/9781400884179 · Cited by 2,713
Computing the shortest path: A search meets graph theory
Goldberg, A. V., & Harrelson, C. (2005) · doi:10.5555/1070432.1070455 · Cited by 719
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Geisberger, R., Sanders, P., Schultes, D., & Delling, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68552-4_24 · Cited by 714
Self-citationShortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Orda, A., & Rom, R. (1990) · Journal of the ACM · doi:10.1145/79147.214078 · Cited by 483
The shortest route through a network with time-dependent internodal transit times
Cooke, K. L., & Halsey, E. (1966) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(66)90009-6 · Cited by 412
Highway Hierarchies Hasten Exact Shortest Path Queries
Sanders, P., & Schultes, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11561071_51 · Cited by 327
Self-citationReach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks.
Gutmann, R. J. (2004) · Cited by 292
FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION∗
Kaufman, D. E., & Smith, R. L. (1993) · IVHS journal · doi:10.1080/10248079308903779 · Cited by 284
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
Goldberg, A. V., Kaplan, H., & Werneck, R. F. (2006) · 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) · doi:10.1137/1.9781611972863.13 · Cited by 247
Fast Routing in Road Networks with Transit Nodes
Bast, H., Funke, S., Sanders, P., & Schultes, D. (2007) · Science · doi:10.1126/science.1137521 · Cited by 228
Self-citationEfficient models for timetable information in public transportation systems
Pyrga, E., Schulz, F., Wagner, D., & Zaroliagis, C. (2008) · ACM Journal of Experimental Algorithmics · doi:10.1145/1227161.1227166 · Cited by 211
Self-citationIn Transit to Constant Time Shortest-Path Queries in Road Networks
Bast, H., Funke, S., Matijevic, D., Sanders, P., & Schultes, D. (2007) · 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) · doi:10.1137/1.9781611972870.5 · Cited by 191
Self-citationCombining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., & Wagner, D. (2010) · ACM Journal of Experimental Algorithmics · doi:10.1145/1671970.1671976 · Cited by 190
Self-citationFast point-to-point shortest path computations with arc-flags
Hilger, M., Köhler, E., Möhring, R. H., & Schilling, H. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/03 · Cited by 184
Schultes, D., & Sanders, P. (2007) · Springer eBooks · doi:10.1007/978-3-540-72845-0_6 · Cited by 179
Self-citationEngineering Highway Hierarchies
Sanders, P., & Schultes, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11841036_71 · Cited by 172
Self-citationDijkstra's algorithm on-line: an empirical case study from public railroad transport
Schulz, F., Wagner, D., & Weihe, K. (2000) · ACM Journal of Experimental Algorithmics · doi:10.1145/351827.384254 · Cited by 170
Self-citation(2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-44867-5 · Cited by 162
Partitioning graphs to speedup Dijkstra's algorithm
Möhring, R. H., Schilling, H., Schütz, B., Wagner, D., & Willhalm, T. (2007) · ACM Journal of Experimental Algorithmics · doi:10.1145/1187436.1216585 · Cited by 158
Self-citationSHARC: Fast and robust unidirectional routing
Bauer, R., & Delling, D. (2009) · ACM Journal of Experimental Algorithmics · doi:10.1145/1498698.1537599 · Cited by 156
Self-citationMulti-criteria Shortest Paths in Time-Dependent Train Networks
Disser, Y., Müller‐Hannemann, M., & Schnee, M. (2008) · Springer eBooks · doi:10.1007/978-3-540-68552-4_26 · Cited by 146
Using Multi-level Graphs for Timetable Information in Railway Systems
Schulz, F., Wagner, D., & Zaroliagis, C. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45643-0_4 · Cited by 145
Self-citationPartitioning Graphs to Speed Up Dijkstra’s Algorithm
Möhring, R. H., Schilling, H., Schütz, B., Wagner, D., & Willhalm, T. (2005) · Lecture notes in computer science · doi:10.1007/11427186_18 · Cited by 140
Self-citationRoute Planning in Road Networks
Schultes, D. (2008) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000007755 · Cited by 135
Self-citationComputing Many-to-Many Shortest Paths Using Highway Hierarchies
Knopp, S., Sanders, P., Schultes, D., Schulz, F., & Wagner, D. (2007) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611972870.4 · Cited by 132
Self-citationLandmark-Based Routing in Dynamic Graphs
Delling, D., & Wagner, D. (2007) · Springer eBooks · doi:10.1007/978-3-540-72845-0_5 · Cited by 129
Self-citationTimetable Information: Models and Algorithms
Müller‐Hannemann, M., Schulz, F., Wagner, D., & Zaroliagis, C. (2007) · Springer eBooks · doi:10.1007/978-3-540-74247-0_3 · Cited by 128
Self-citationBidirectional A ∗ Search for Time-Dependent Fast Paths
Nannicini, G., Delling, D., Liberti, L., & Schultes, D. (2008) · Springer eBooks · doi:10.1007/978-3-540-68552-4_25 · Cited by 125
Self-citationEngineering Fast Route Planning Algorithms
Sanders, P., & Schultes, D. (2007) · Springer eBooks · doi:10.1007/978-3-540-72845-0_2 · Cited by 118
Self-citationEngineering multilevel overlay graphs for shortest-path queries
Holzer, M., Schulz, F., & Wagner, D. (2008) · ACM Journal of Experimental Algorithmics · doi:10.1145/1412228.1412239 · Cited by 117
Self-citationAcceleration of Shortest Path and Constrained Shortest Path Computation
Köhler, E., Möhring, R. H., & Schilling, H. (2005) · Lecture notes in computer science · doi:10.1007/11427186_13 · Cited by 108
Delling, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87744-8_28 · Cited by 108
Self-citationThorup, M. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780566 · Cited by 105
Geometric containers for efficient shortest-path computation
Wagner, D., Willhalm, T., & Zaroliagis, C. (2005) · ACM Journal of Experimental Algorithmics · doi:10.1145/1064546.1103378 · Cited by 105
Self-citationHutchison, D., Weikum, G., Vardi, M. Y., Tygar, D., Terzopoulos, D., Sudan, M., Steffen, B., Rangan, C. P., Nierstrasz, O., Naor, M., et al. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87744-8 · Cited by 95
Goldberg, A. V., Kaplan, H. Y., & Werneck, R. F. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72845-0_4 · Cited by 93
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm
Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., & Wagner, D. (2008) · Springer eBooks · doi:10.1007/978-3-540-68552-4_23 · Cited by 88
Self-citationCombining speed-up techniques for shortest-path computations
Holzer, M., Schulz, F., Wagner, D., & Willhalm, T. (2005) · ACM Journal of Experimental Algorithmics · doi:10.1145/1064546.1180616 · Cited by 78
Self-citationExperimental study of speed up techniques for timetable information systems
Bauer, R., Delling, D., & Wagner, D. (2010) · Networks · doi:10.1002/net.20382 · Cited by 77
Self-citationReach for A*: shortest path algorithms with preprocessing
Goldberg, A. V., Kaplan, H. Y., & Werneck, R. F. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/05 · Cited by 75
Engineering Label-Constrained Shortest-Path Algorithms
Barrett, C., Bisset, K. R., Holzer, M., Konjevod, G., MARATHE, M. V., & Wagner, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-68880-8_5 · Cited by 66
Self-citationDelling, D., Sanders, P., Schultes, D., & Wagner, D. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/06 · Cited by 65
Self-citationFinding All Attractive Train Connections by Multi-criteria Pareto Search
Müller‐Hannemann, M., & Schnee, M. (2007) · Springer eBooks · doi:10.1007/978-3-540-74247-0_13 · Cited by 64
Continuous-Time Dynamic Shortest Path Algorithms
Dean, B. C. (1999) · Cited by 61
Using Multi-Level Graphs for Timetable Information
Schulz, F., Wagner, D., & Zaroliagis, C. (2001) · Cited by 57
Self-citationSanders, P., Schultes, D., & Vetter, C. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87744-8_61 · Cited by 54
Self-citationHigh-performance multi-level routing
Delling, D., Holzer, M., Müller, K., Schulz, F., & Wagner, D. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/04 · Cited by 44
Self-citationBidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
Delling, D., & Nannicini, G. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92182-0_71 · Cited by 43
Self-citationCombining Speed-Up Techniques for Shortest-Path Computations
Holzer, M., Schulz, F., & Willhalm, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24838-5_20 · Cited by 43
Lauther, U. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/02 · Cited by 42
Engineering Multi-Level Overlay Graphs for Shortest-Path Queries
Holzer, M., Schulz, F., & Wagner, D. (2006) · doi:10.1137/1.9781611972863.15 · Cited by 31
Self-citationRobust, almost constant time shortest-path queries in road networks
Sanders, P., & Schultes, D. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/08 · Cited by 22
Self-citationFast and Compact Oracles for Approximate Distances in Planar Graphs
Muller, L. F., & Zachariasen, M. (2007) · Springer eBooks · doi:10.1007/978-3-540-75520-3_58 · Cited by 19
Engineering Planar-Separator and Shortest-Path Algorithms
Holzer, M. (2008) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000009237 · Cited by 11
Cited by
A Review of Motion Planning for Highway Autonomous Driving
Claussmann, L., Revilloud, M., Gruyer, D., & Glaser, S. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2019.2913998 · Cited by 670
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
Self-citationAmhaz, R., Chambon, S., Idier, J., & Baltazart, V. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2477675 · Cited by 507
Real-time routing with OpenStreetMap data
Luxen, D., & Vetter, C. (2011) · Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems · doi:10.1145/2093973.2094062 · Cited by 478
Exact Routing in Large Road Networks Using Contraction Hierarchies
Geisberger, R., Sanders, P., Schultes, D., & Vetter, C. (2012) · Transportation Science · doi:10.1287/trsc.1110.0401 · Cited by 323
Self-citation
Metadata
- Authors
- Delling, D., Sanders, P., Schultes, D., & Wagner, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 117-139
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2168148394
- Cited by
- 454
- References
- 59
- FWCI
- 26.87
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.