Engineering Shortest Path Algorithms [chapter]

Camil Demetrescu, Giuseppe F. Italiano
2004 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-540-24838-5_14 fatcat:uggagxe7gfcchbumfusicft2jy