On the difficulty of some shortest path problems

ACM Transactions on Algorithms

Volumn 3, Issue 1, 2007, Pages

  Hershberger, John ^a,c   Suri, Subhash ^b   Bhosle, Amit ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of California   (United States)

Author keywords

K shortest simple paths; Lower bound; Replacement path; Shortest path

Indexed keywords

LOWER BOUNDS; REPLACEMENT PATHS; SHORTEST PATH; SHORTEST SIMPLE PATHS;

ALGORITHMS; COMPUTATIONAL METHODS; LINEAR SYSTEMS; PROBLEM SOLVING; SET THEORY;

GRAPH THEORY;

EID: 33847293858     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1186810.1186815     Document Type: Conference Paper

References (29)

1. ALON, N., GALIL, Z., AND MARGALIT, O. 1991. On the exponent of the all pairs shortest path problem. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science. 569-575.
2. ARCHER, A. 2001. Private communication.
3. ARCHER, A., AND TARDOS, E. 2002. Frugal path mechanisms. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 991-999.
4. BALL, M. O., GOLDEN, B. L., AND VOHRA, R. V. 1989. Finding the most vital arcs in a network. Oper. Res. Lett. 8, 73-76.
5. BAR-NOY, A., KHULLER, S., AND SCHIEBER, B. 1995. The complexity of finding most vital arcs and nodes. Tech. Rep. CS-TR-3539, Institute for Advanced Studies, University of Maryland, College Park, MD.
6. BRANDER, A., AND SINCLAIR, M. 1995. A comparative study of K-shortest path algorithms. In Proceedings of the 11th UK Performance Engineering Workshop. 370-379.
7. EPPSTEIN, D. 1998. Finding the k shortest paths. SIAM J. Comput. 28, 2, 652-673.
8. FORTZ, B., AND THORUP, M. 2000. Internet traffic engineering by optimizing OSPF weights. In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies. 519-528.
9. FREDMAN, M. 1976. New bounds on the complexity of the shortest path problem. SIAM J. Comput. 5, 83-89.
10. HADJICONSTANTINOU, E., AND CHRISTOFIDES, N. 1999. An efficient implementation of an algorithm for finding K shortest simple paths. Netw. 34, 2 (Sept.), 88-101.
11. HERSHBERGER, J., MAXEL, M., AND SURI, S. 2007. Finding the k shortest simple paths: A new algorithm and its implementation. ACM Trans. Algorithms. To appear.
12. 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. 252-259.
13. HERSHBERGER, J., AND SURI, 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. 809.
14. KARGER, D. R., KOLLER, D., AND PHILLIPS, S. J. 1993. Finding the hidden path: Time bounds for all-pairs shortest paths. SIAM J. Comput. 22, 1199-1217.
15. KATOH, N., IBARAKI, T., AND MINE, H. 1982. An efficient algorithm for k shortest simple paths. Netw. 12, 411-427.
16. KIRKPATRICK, D., AND REISCH, S. 1984. Upper bounds for sorting integers on random access machines. Theor. Comput. Sci. 28, 3, 263-276.
17. LAWLER, E. L. 1972. A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Manage. Sci. 18, 401-405.
18. MALIK, K., MITTAL, A. K., AND GUPTA, S. K. 1989. The k most vital arcs in the shortest path problem. Oper. Res. Lett. 8, 223-227.
19. MARTINS, E., AND PASCOAL, M. 2000. A new implementation of Yen's ranking loopless paths algorithm. Submited for publication, Universidade de Coimbra, Portugal.
20. MARTINS, E., PASCOAL, M., AND SANTOS, J. 1997. A new algorithm for ranking loopless paths. Tech. Rep., Universidade de Coimbra, Portugal.
21. NARDELLI, E., PROIETTI, G., AND WIDMAYER, P. 2001. Finding the most vital node of a shortest path. Theor. Comput. Sci. 296, 1, 167-177.
22. NISAN, N., AND RONEN, A. 1999. Algorithmic mechanism design. In Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, 129-140.
23. PAUL, W. J., AND SIMON, J. 1980. Decision trees and random access machines. In Proceedings of the International Symposium on Logic and Algorithmic. 331-340.
24. PERKO, A. 1986. Implementation of algorithms for K shortest loopless paths. Netw. 16, 149-160.
25. TAKAOKA, T. 1992. A new upper bound on the complexity of the all pairs shortest path problem. Inf. Process. Lett. 43, 195-199.
26. YEN, J. Y. 1971. Finding the K shortest loopless paths in a network. Manage. Sci. 17, 712-716.
27. 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.
28. ZWICK, U. 1998. All pairs shortest paths in weighted directed graphs - Exact and almost exact algorithms. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science. 310-319.
29. ZWICK, U. 2002. All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM 49, 3, 289-317.