Finding the k shortest simple paths: A new algorithm and its implementation

ACM Transactions on Algorithms

Volumn 3, Issue 4, 2007, Pages

  Hershberger, John ^a,c   Maxel, Matthew ^b,c   Suri, Subhash ^b,c  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of California   (United States)

Author keywords

Directed paths; Loop free paths; Path equivalence class; Replacement paths

Indexed keywords

DIRECTED PATHS; LOOP-FREE PATHS; PATH EQUIVALENCE CLASS; REPLACEMENT PATHS;

AD HOC NETWORKS; GEOGRAPHIC INFORMATION SYSTEMS; GRAPH THEORY; PROBLEM SOLVING;

ALGORITHMS;

EID: 36448972779     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1290672.1290682     Document Type: Conference Paper

References (23)

1. BRANDER, A., AND SINCLAIR, M. 1995. A comparative study of K-shonest path algori-ims. In Proceedings of 11th UK Performance Engineering Workshop, 370-379.
2. DIAL, R., GLOVER, F., KARNEY, D., AND KLINGMAN, D. 1979. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Netw. 9, 3, 215-248.
3. EPPSTEIN, D. 1998. Finding the k shortest paths. SIAM J. Comput. 28, 2, 652-673.
4. FOX, B. L. 1975. k-th shortest paths and applications to the probabilistic networks. In Proceedings of the ORSAITIMS Joint National Meeting 23, B263.
5. FREDMAN, M. 1976. New bounds on the complexity of the shortest path problem. SMM J. Comput. 5, 83-89.
6. FREDMAN, M., AND TARJAN, R. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596-615.
7. HADJICONSTANTINOU.E., AND CHRISTOFIDES, N. 1999. An efficient implementation of an algorithm for finding Kshortest simple paths. Netw. 34, 2, 88-101.
8. HERSHBERGER, J., AND SURI. S. 2001. Vickrey prices and shortest paths: What is an edge worth? In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 252-259.
9. HERSHBERGER, J., AND SURL S. 2002. Erratum to "Vickrey prices and shortest paths: What is an edge worth?". In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 809.
10. HERSHBERQER, J., SURI, S., AND BHOSLE. A. 2007. On the difficulty of some shortest path problems. ACM Trans. Alg. 3, 1, Article 5. http://doi.acm.Org/10.1145/1219944. 1219951.
11. HOFFMAN, W., AND PAVLEY, R. 1959. A method for the solution of the Nth best path problem. J. ACM 6, 506-514
12. JIMÉNEZ, V. M., AND MARZAL, A. 2003. A lazy version of Eppstein's K shortest paths algorithm, In Pwceedings of the 2nd International Workshop on Experimental ami Efficient Algorithms (WEA). Lecture Notes in Computer Science, vol. 2647. Springer, 179-190.
13. KATOH, N., IBARAKI, T., AND MINE, H. 1982. An efficient algorithm for k shortest simple paths. Netw. 12, 411-427.
14. LAWLER, E. L. 1972. A procedure for computing the JST best solutions to discrete optimization problems and its application to the shortest path problem. Manag. Sci. 18, 401-405.
15. MALIK, K., MOTAL, A. K., AND GUPTA, S. K. 1989. The k most vital arcs in the shortest path problem. Oper. Res. Lett. 8, 223-227.
16. MARTINS, E., AND PASCOAL, M. 2003. A new implementation of Yen's ranking loopless paths algorithm. 4OR Quart. J. Belgian, French, Italian Oper. Res. Soc. 1, 2, 121-134.
17. MARTINS, E., PASCOAL, M., AND SANTOS, J. 1997. A new algorithm for ranking loopless paths. Tech. Rep. Universidade de Coimbra, Portugal.
18. PERKO, A. 1986. Implementation of algorithms for K shortest loopless paths. Netw. 16, 149-160.
19. POLLACK, M. 1961. The kth best route through a network. Oper. Res. 9, 578.
20. SEIDEL, R. 1995. On the all-pairs-shortest-path problem in unweighted undirected graphs. Journal of Comput. Syst. Sci. 51, 3, 400-403.
21. YEN, J. Y. 1971. Finding the K shortest loopless paths in a network. Manag. Sci. 17, 712-716.
22. YEN, J. Y. 1972. Another algorithm for finding the K shortest loopless network paths. In Proceedings of the 41st Meeting of the Operations Research Society of America, vol. 20.
23. ZWICK, U. 2002. All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM 49, 3, 289-317.