A lazy version of Eppstein's K shortest paths algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2647, Issue , 2003, Pages 179-190

  Jiménez, Víctor M ^a   Marzal, Andrés ^a  

^a UNIVERSITAT JAUME I   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; TREES (MATHEMATICS);

K SHORTEST PATH; RUNNING TIME; S-ALGORITHMS; SHORTEST PATH; SHORTEST PATH TREE; WEIGHTED DIGRAPH;

GRAPH THEORY;

EID: 33144480714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44867-5_14     Document Type: Article

References (17)

1. J. Azevedo, M. Costa, J. Madeira, and E. Martins. An algorithm for the ranking of shortest paths. European J. Op. Res., 69:97-106, 1993.
2. J. Azevedo, J. Madeira, E. Martins, and F. Pires. A computational improvement for a shortest paths ranking algorithm. European J. Op. Res., 73:188-191, 1994.
3. R. Bellman and R. Kalaba. On kth best policies. J. SIAM, 8(4):582-588, 1960.
4. T. Cormen, C. E. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, Cambridge, MA, 2nd edition, 2001.
5. S. Dreyfus. An appraisal of some shortest-path algorithms. Op. Res., 17:395-412, 1969.
6. D. Eppstein. Finding the k shortest paths. SIAM J. Computing, 28(2):652-673, 1999.
7. B. L. Fox. Calculating kth shortest paths. INFOR - Canad. J. Op. Res. and Inform. Proces., 11(1):66-70, 1973.
8. B. L. Fox. Data structures and computer science techniques in operations research. Op. Res., 26(5):686-717, 1978.
9. V. M. Jiménez and A. Marzal. Computing the k shortest paths: a new algorithm and an experimental comparison. Lecture Notes in Computer Science, 1668:15-29, 1999. (http://terra.act.uji.es/REA/papers/wae99.ps.gz).
10. E. Martins and J. Santos. A new shortest paths ranking algorithm. Technical report, Departamento de Matemática, Universidade de Coimbra, 1996. (http://www.mat.uc.pt/∼eqvm).
11. E. Q. V. Martins. An algorithm for ranking paths that may contain cycles. European J. Op. Res., 18:123-130, 1984.
12. K. Mehlhorn and M. Ziegelman. Resource constrained shortest paths. Lecture Notes in Computer Science, 1879:326-337, 2000.
13. S. P. Miaou and S. M. Chin. Computing K-shortest paths for nuclear spent fuel highway transportation. European J. Op. Res., 53:64-80, 1991.
14. D. R. Shier. Iterative methods for determining the k shortest paths in a network. Networks, 6:205-229, 1976.
15. D. R. Shier. On algorithms for finding the k shortest paths in a network. Networks, 9:195-214, 1979.
16. C. C. Skicism and B. L. Golden. Computing k-shortest path lengths in euclidean networks. Networks, 17:341-352, 1987.
17. C. C. Skicism and B. L. Golden. Solving k-shortest and constrained shortest path problems efficiently. Annals of Op. Res., 20:249-282, 1989.