Reach for A*: Efficient point-to-point shortest path algorithms

Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
PublisherSociety for Industrial and Applied Mathematics (SIAM)
Pages129-143
Number of pages15
ISBN (Print)0898716101, 9780898716108
DOIs
StatePublished - 2006
Event8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics - Miami, FL, United States
Duration: 21 Jan 200621 Jan 2006

Publication series

NameProceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
Volume2006

Conference

Conference8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
Country/TerritoryUnited States
CityMiami, FL
Period21/01/0621/01/06

Fingerprint

Dive into the research topics of 'Reach for A*: Efficient point-to-point shortest path algorithms'. Together they form a unique fingerprint.

Cite this