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 efficient in practice can yield interesting clues to the combinatorial properties of the problem, and eventually lead to new theoretically efficient algorithms. © Springer-Verlag 2004.
CITATION STYLE
Demetrescu, C., & Italiano, G. F. (2004). Engineering shortest path algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3059, 194–198. https://doi.org/10.1007/978-3-540-24838-5_14
Mendeley helps you to discover research relevant for your work.