CiteSeerX — Shortest Paths Algorithms: Theory And Experimental Evaluation

Shortest Paths Algorithms: Theory And Experimental Evaluation (1993) [111 citations — 14 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@ARTICLE{Cherkassky93shortestpaths,
    author = {Boris V. Cherkassky and Andrew V. Goldberg and Tomasz Radzik},
    title = {Shortest Paths Algorithms: Theory And Experimental Evaluation},
    journal = {Mathematical Programming},
    year = {1993},
    volume = {73},
    pages = {129--174}
}

Years of Citing Articles

Bookmarks

OpenURL

Abstract:

. 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. Andrew V. Goldberg was supported in part by ONR Young Investigator Award N00014-91-J-1855, NSF Presidential Young Investigator Grant CCR-8858097 with matching funds from AT&T, DEC, and 3M, and a grant from Powell Foundation. This work was done while Boris V. Cherkassky was visiting Stanford University Compu...

Citations

6121	Introduction to Algorithms – Cormen, Leiserson, et al. - 2001
551	note on two problems in connection with graphs – Dijkstra - 1959
524	Flows in networks – Ford, Fulkerson - 1962
503	Data Structures and Network Algorithms – Tarjan - 1974
412	Fibonacci heaps and their uses in improved network optimization algorithms – Fredman, Tarjan - 1987
332	Combinatorial Optimization: Networks and Matroids – Lawler - 1976
213	On a routing problem – Bellman - 1958
104	Faster scaling algorithms for network problems – Gabow, Tarjan - 1989
83	Faster algorithms for the shortest path problem – Ahuja, Mehlhorn, et al. - 1990
74	The shortest path through a maze – Moore - 1959
55	Algorithm 360: Shortest path forest with topological ordering – Dial - 1969
46	Shortest Path Algorithms – Gallo, Pallotino - 1988
38	Scaling algorithms for the shortest paths problem – Goldberg - 1993
18	Implementation and efficiency of Moore - algorithms for the shortest route problems – Pape - 1974
17	Polynomial Auction algorithms for shortest paths – Bertsekas, Pallottino, et al. - 1995
16	Computational study of an improved shortest path algorithm”, Networks 14 – Glover, Glover, et al. - 1984
16	A new polynomially bounded Shortest Path Algorithm – Glover, Klingman, et al. - 1985
13	A heuristic improvement of the Bellman-Ford algorithm – Goldberg, Radzik - 1993
5	Neleneinye Setevye Transportnye Zadachi. Transport – Levit, Livshits - 1972
4	A note on finding shortest path trees – Kershenbaum - 1981
2	Properties of Labeling Mehtods for Determinimg Shortest Paths – Shier, Witzgall - 1981