The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
Abstract
We study the point-to-point shortest path problem in a setting where preprocessing is allowed. We improve the reach-based approach of Gutman [17] in several ways. In particular, we introduce a bidirectional version of the algorithm that uses implicit lower bounds and we add shortcut arcs to reduce vertex reaches. Our modifications greatly improve both preprocessing and query times. The resulting algorithm is as fast as the best previous method, due to Sanders and Schultes [28]. However, our algorithm is simpler and combines in a natural way with A* search, which yields significantly better query times.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Cited by
Benchmarks for Grid-Based Pathfinding
Sturtevant, N. R. (2012) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2012.2197681 · Cited by 549
Combining 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
Multi-Task Federated Learning for Traffic Prediction and Its Application to Route Planning
Zeng, T., Guo, J., Kim, K. J., Parsons, K., Orlik, P., Di Cairano, S., & Saad, W. (2021) · 2021 IEEE Intelligent Vehicles Symposium (IV) · doi:10.1109/iv48863.2021.9575211 · Cited by 49
Metadata
- Authors
- Goldberg, A. V., Kaplan, H., & Werneck, R. F.
- Venue
- 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX)
- Published
- 2006-01-21
- Pages
- 129-143
- OpenAlex
- W2151400766
- Cited by
- 247
- References
- 1
- FWCI
- 17.49
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. https://app.cochat.ai/papers/10.1137/1.9781611972863.13
- The paper
- Goldberg, A. V., Kaplan, H., & Werneck, R. F. (2006). Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX). https://doi.org/10.1137/1.9781611972863.13
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.
