Finding the k Shortest Paths
- 1 January 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (2) , 652-673
- https://doi.org/10.1137/s0097539795290477
Abstract
No abstract availableThis publication has 36 references indexed in Scilit:
- Algorithms for proximity problems in higher dimensionsComputational Geometry, 1996
- Finding the k quickest simple paths in a networkInformation Processing Letters, 1994
- Algorithms for the constrained quickest path problem and the enumeration of quickest pathsComputers & Operations Research, 1994
- An algorithm for the ranking of shortest pathsEuropean Journal of Operational Research, 1993
- An algorithm for finding the k quickest paths in a networkComputers & Operations Research, 1993
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic ProgrammingOperations Research, 1984
- All paths in an activity networkMathematische Operationsforschung und Statistik, 1976
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- On a routing problemQuarterly of Applied Mathematics, 1958