Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms

A.V. Goldberg, Haim Kaplan, and Renato F. Werneck


We study the point-to-point shortest path problem in a setting where preprocessing is allowed. We improve the reach-based approach of Gutman in several ways. We introduce a bidirectional version of the algorithm that uses implicit lower bounds and we add shortcut arcs which reduce vertex reaches. Our modifications greatly reduce both preprocessing and query times. The resulting algorithm is competitive with the best previous method, due to Sanders and Schultes. However, our algorithm is simpler and combines in a natural way with A* search, which yields significantly better query times.


Publication typeInproceedings
Published inSIAM Workshop on Algorithms Engineering and Experimentation (ALENEX 06)
InstitutionMicrosoft Research
AddressMiami, FL
PublisherSociety for Industrial and Applied Mathematics
> Publications > Reach for A*: Efficient Point-to-Point Shortest Path Algorithms