Engineering Shortest Path Algorithms
by
Camil Demetrescu
,
Giuseppe F. Italiano
| Citations: | 1 - 0 self |
BibTeX
@MISC{Demetrescu_engineeringshortest,
author = {Camil Demetrescu and Giuseppe F. Italiano},
title = {Engineering Shortest Path Algorithms},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we report on our own experience in studying a fundamental problem on graphs: all pairs shortest paths. In particular, we discuss the interplay between theory and practice in engineering a simple variant of Dijkstra's shortest path algorithm. In this context, we show that studying heuristics that are e#cient in practice can yield interesting clues to the combinatorial properties of the problem, and eventually lead to new theoretically e#cient algorithms.
Citations
| 7321 | Introduction to Algorithms - Cormen, Leiserson, et al. - 2001 |
| 1011 | A note on two problems in connexion with graphs. Numerische Mathematik 1: 269–271 - Dijkstra - 1959 |
| 493 | Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987 |
| 124 | Shortest Paths Algorithms: Theory and Experimental - Cherkassky, Goldberg, et al. - 1996 |
| 48 | A new approach to dynamic all pairs shortest paths - Demetrescu, Italiano - 2003 |
| 27 | Experimental analysis of dynamic all pairs shortest path algorithms. url: http://www.dis.uniroma1.it/ ˜ demetres - Demetrescu, Emiliozzi, et al. |
| 16 | Computing shortest paths with comparisons and additions - Pettie, Ramachandran - 2002 |
| 11 | Experimental evaluation of a new shortest path algorithm - Pettie, Ramachandran, et al. |
| 8 | A faster all-pairs shortest path algorithm for real-weighted sparse graphs - Pettie - 2002 |
| 2 | Algorithm engineering - Demetrescu, Finocchi, et al. |
| 2 | Tighter fully-dynamic all pairs shortest paths - Thorup - 2003 |
