Shortest paths algorithms: Theory and experimental evaluation
- 1.5k Downloads
We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research.
KeywordsGraph algorithms Network optimization Shortest paths Theory and experimental evaluation of algorithms
Unable to display preview. Download preview PDF.
- H.N. Gabow and R.E. Tarjan, “Faster scaling algorithms for network problems”,SIAM J. Comput. (1989) 1013–1036.Google Scholar
- F. Glover, R. Glover and D. Klingman, “Computational study of an improved shortest path algorithm”,Networks 14 (1984) 25–37.Google Scholar
- A.V. Goldberg, “Scaling algorithms for the shortest paths problem”, in:Proceedings 4th ACM-SIAM Symposium on Discrete Algorithms (1993) 222–231.Google Scholar
- D.S. Johnson and C.C. McGeoch, eds.,Network Flows and Matching: First DIMACS Implementation Challenge (AMS, 1993).Google Scholar
- B.Ju. Levit and B.N. Livshits,Neleneinye Setevye Transportnye Zadachi (Transport, Moscow, 1972), in Russian.Google Scholar
- E.F. Moore, “The shortest path through a maze”, in:Proceedings of the Int. Symp. on the Theory of Switching (Harvard University Press, 1959) 285–292.Google Scholar
- R.E. Tarjan,Data Structures and Network Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983).Google Scholar