• DOI:10.1145/1671970.1671976
Corpus ID: 1661292

Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm

@article{Bauer2010CombiningHA,
  title={Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm},
  author={R. Bauer and D. Delling and P. Sanders and Dennis Schieferdecker and Dominik Schultes and D. Wagner},
  journal={ACM J. Exp. Algorithmics},
  year={2010},
  volume={15}
}

R. Bauer, D. Delling, +3 authors D. Wagner

Published 2010

Computer Science

ACM J. Exp. Algorithmics

View on ACM

publikationen.bibliothek.kit.edu

Save to Library

Create Alert

Cite

Launch Research Feed

In recent years, highly effective hierarchical and goal-directed speed-up techniques for routing in large road networks have been developed. This article makes a systematic study of combinations of such techniques. These combinations turn out to give the best results in many scenarios, including graphs for unit disk graphs, grid networks, and time-expanded timetables. Besides these quantitative results, we obtain general insights for successful combinations.