Shortest path feasibility algorithms: An experimental evaluation

Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics

Volumn , Issue , 2008, Pages 118-132

  Cherkassky, Boris V ^a   Georgiadis, Loukas ^b   Goldberg, Andrew V ^c   Tarjan, Robert E ^d   Werneck, Renato F ^c  

^a CENTRAL ECONOMICS AND MATHEMATICS INSTITUTE   (Russian Federation)

^b HEWLETT PACKARD LABORATORIES   (United States)

^c MICROSOFT RESEARCH   (United States)

^d Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERIMENTAL EVALUATION; FEASIBILITY PROBLEM; ROBUST PERFORMANCE; SHORT-PATH; STATE OF THE ART; WEIGHTED GRAPH; WORST-CASE INSTANCES;

DIRECTED GRAPHS;

EID: 58349105981     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972887.12     Document Type: Conference Paper

References (26)

1. R. E. Bellman. On a Routing Problem. Quart. Appl. Math., 16:87-90, 1958.
2. B. V. Cherkassky and A. V. Goldberg. Negative-Cycle Detection Algorithms. Math. Prog., 85:277-311, 1999.
3. B. V. Cherkassky, A. V. Goldberg, and T. Radzik. Shortest Paths Algorithms: Theory and Experimental Evaluation. Math. Prog., 73:129-174, 1996.
4. A. Dasdan. Experimental Analysis of the Fastest Optimum Cycle Ratio and Mean Algorithms. ACM Trans, on Design Automation of Electronic Systems, 9(4):385-418, 2004.
5. R. Dechter, I. Meiri, and J. Pearl. Temporal Constraint Networks. Artificial Intelligence, 49:61-95, 1991.
6. C. Demetrescu, A.V. Goldberg, and D.S. Johnson. 9th DIMACS Implementation Challenge: Shortest Paths. http://www.dis.uniromal.it/-challenge9/, 2007.
7. E. V. Denardo and B. L. Fox. Shortest-Route Methods: 1. Reaching, Pruning, and Buckets. Oper. Res., 27:161-186, 1979.
8. R. B. Dial, F. Glover, D. Karney, and D. Klingman. A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees. Networks, 9:215-248, 1979.
9. E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numer. Math., 1:269-271, 1959.
10. L.R. Ford, Jr. Network Flow Theory. Technical Report P-932, The Rand Corporation, 1956.
11. L.R. Ford, Jr. and D. R. Fulkerson. Flows in Networks. Princeton Univ. Press, Princeton, NJ, 1962.
12. M. L. Fredman and R. E. Tarjan. Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. J. Assoc. Comput. Mach., 34:596-615, 1987.
13. G. Gallo and S. Pallottino. Shortest Paths Algorithms. Annals of Oper. Res., 13:3-79, 1988.
14. A. V. Goldberg. Scaling Algorithms for the Shortest Paths Problem. SIAM J. Comput, 24:494-504, 1995.
15. A. V. Goldberg and T. Radzik. A Heuristic Improvement of the Bellman-Ford Algorithm. Applied Math. Let, 6:3-6, 1993.
16. J. L. Kennington and R. V. Helgason. Algorithms for Network Programming. John Wiley and Sons, 1980.
17. 3) Expected Time. In Proc. 5th Int. Programming and Combinatorial Optimization Conf., 1996.
18. E. F. Moore. The Shortest Path Through a Maze. In Proc. of the Int. Symp. on the Theory of Switching, pages 285-292. Harvard University Press, 1959.
19. M. Nonato, S. Pallottino, and B. Xuewen. SPTX Shortest Path Algorithms: Reviews, New Proposals, and Some Experimental Results. Technical Report TR-99-16, Dipartmento di Informatica, Pisa University, Italy, 1999.
20. S. Pallottino. Shortest-Path Methods: Complexity, Interrelations and New Propositions. Networks, 14:257-267, 1984.
21. U. Pape. Implementation and Efficiency of Moore Algorithms for the Shortest Root Problem. Math. Prog., 7:212-222, 1974.
22. R. E. Tarjan. Depth-First Search and Linear Graph Algorithms. SIAM J. Comput, 1:146-160, 1972.
23. R. E. Tarjan. Shortest Paths. Technical report, AT&T Bell Laboratories, Murray Hill, NJ, 1981.
24. R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
25. G. Tseitin. On the Complexity of Derivation in Propo-sitional Calculus. In Studies in Constructive Mathematics and Mathematical Logic, pages 115-125, 1970.
26. C-H. Wong and Y-C Tam. Negative Cycle Detection Problem. In Proc. 13th Annual European Symposium on Algorithms, pages 652-663, 2005.