Speed-Up Techniques for Shortest-Path Computations (2007)
| Venue: | IN PROCEEDINGS OF THE 24TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS’07 |
| Citations: | 13 - 7 self |
BibTeX
@INPROCEEDINGS{Wagner07speed-uptechniques,
author = {Dorothea Wagner and Thomas Willhalm},
title = {Speed-Up Techniques for Shortest-Path Computations},
booktitle = {IN PROCEEDINGS OF THE 24TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS’07},
year = {2007},
pages = {23--36},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
During the last years, several speed-up techniques for Dijkstra’s algorithm have been published that maintain the correctness of the algorithm but reduce its running time for typical instances. They are usually based on a preprocessing that annotates the graph with additional information which can be used to prune or guide the search. Timetable information in public transport is a traditional application domain for such techniques. In this paper, we provide a condensed overview of new developments and extensions of classic results. Furthermore, we discuss how combinations of speed-up techniques can be realized to take advantage from different strategies.
