On the k-simple shortest paths problem in weighted directed graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 920-928

  Roditty, Liam ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; DIRECTED GRAPHS;

K SHORTEST PATH; RUNNING TIME; SHORTEST PATH; WEIGHTED DIRECTED GRAPH;

GRAPH THEORY;

EID: 84969235544     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing, 28:1167-1181, 1999.
2. A. W. Brander and Mark C. Sinclair. A comparative study of k-shortest path algorithms. In Proc. 11th UK Performance Engineering Worksh. for Computer and Telecommunications Systems, September 1995.
3. T.M. Chan. All-pairs shortest paths for unweighted undirected graphs in o(mn) time. In Proc. of 17th SODA, pages 514-523, 2006.
4. E. Cohen and U. Zwick. All-pairs small-stretch paths. Journal of Algorithms, 38:335-353, 2001.
5. Ernesto de Queirós Vieira Martins, Marta Margarida Braz Pascoal, and José Luís Esteves dos Santos. Deviation algorithms for ranking shortest paths. Int. J. Found. Comp. Sci., 10(3):247-263, 1999.
6. C. Demetrescu and M. Thorup. Oracles for distances avoiding a link-failure. In Proc. of 13th SODA, pages 838-843, 2002.
7. D. Dor, S. Halperin, and U. Zwick. All pairs almost shortest paths. SIAM Journal on Computing, 29:1740-1759, 2000.
8. M. Elkin. Computing almost shortest paths. In Proc. of 20th PODC, pages 53-62, 2001.
9. D. Eppstein. Finding the k shortest paths. SIAM Journal on Computing, 28(2):652-673, 1998.
10. E. Hadjiconstantinou and Nicos Christofides. An efficient implementation of an algorithm for finding K shortest simple paths. Networks, 34(2):88-101, September 1999.
11. J. Hershberger and S. Suri. Vickrey prices and shortest paths: what is an edge worth? In Proc. of 42nd FOCS, pages 252-259, 2001.
12. N. Katoh, T. Ibaraki, and H. Mine. An efficient algorithm for K shortest simple paths. Networks, 12(4):411-427, 1982.
13. E.L. Lawler. A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18:401-405, 1971/72.
14. K. Malik, A. K. Mittal, and S. K. Gupta. The k most vital arcs in the shortest path problem. Operations Research Letters, 8(4):223-227, 1989.
15. Aarni Perko. Implementation of algorithms for K shortest loopless paths. Networks, 16:149-160, 1986.
16. S. Pettie. A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science, 312(1):47-74, 2004.
17. Liam Roditty and Uri Zwick. Replacement paths and k simple shortest paths in unweighted directed graphs. In Proc. of 32th ICALP, pages 249-260, 2005.
18. Mikkel Thorup and Uri Zwick. Approximate distance oracles. J. ACM, 52(1):1-24, 2005.
19. J.Y. Yen. Finding the K shortest loopless paths in a network. Management Science, 17:712-716, 1970/71.
20. U. Zwick. A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. In Proc. of 15th ISAAC, pages 921-932, 2004.