Shortest paths algorithms: Theory and experimental evaluation
- 1 May 1996
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 73 (2), 129-174
- https://doi.org/10.1007/bf02592101
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Shortest path algorithmsAnnals of Operations Research, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- Properties of Labeling Methods for Determining Shortest Path TreesJournal of Research of the National Bureau of Standards, 1981
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOperations Research, 1979
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- On a routing problemQuarterly of Applied Mathematics, 1958