Near-shortest and K-shortest simple paths

Networks

Volumn 46, Issue 2, 2005, Pages 98-109

  Carlyle, W Matthew ^a   Wood, R Kevin ^a  

^a NAVAL POSTGRADUATE SCHOOL   (United States)

Author keywords

K shortest paths; Near shortest paths; Path enumeration

Indexed keywords

K-SHORTEST PATHS; NEAR-SHORTEST PATHS; PATH ENUMERATION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

GRAPH THEORY;

EID: 24744434770     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20077     Document Type: Article

References (18)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows, Prentice Hall, Englewood Cliffs, NJ.
2. D. Alderson, J. Doyle, R. Govindan, and W. Willinger, Toward an optimization-driven framework for designing and generating realistic internet topologies, ACM SIGCOMM Comput Commun Rev 33 (2003), 41-46.
3. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
4. R. Bellman, On a routing problem, Q Appl Math 16 (1958), 87-90.
5. T.H. Byers and M.S. Waterman, Determining all optimal and near-optimal solutions when solving shortest path problems by dynamic programming, Operat Res 32 (1984), 1381-1384.
6. B.V. Cherkassky, A.V. Goldberg, and T. Radzik, "Shortest path algorithms: Theory and experimental evaluation," Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virgina, 23-25 January, 1994, pp. 516-525.
7. E. Dijkstra, A note on two problems in connexion with graphs, Num Math 1 (1959), 269-271.
8. D. Eppstein, Finding the K shortest paths, SIAM J Comput 28 (1998), 652-673.
9. M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the Internet topology, ACM SIGCOMM Comput Commun Rev 29 (1999), 251-262.
10. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J ACM 34 (1987), 338-346.
11. E. Hadjiconstantinou and N. Christofides, An efficient implementation of an algorithm for finding K shortest simple paths, Networks 34 (1999), 88-101.
12. M. Herzberg, S.J. Bye, and A. Utano, The hop-limit approach for spare-capacity assignment in survivable networks, IEEE/ACM Trans Network 3 (1995), 775-784.
13. R.R. Iraschko, M.H. MacGregor, and W.D. Grover, Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks, IEEE/ACM Trans Network 6 (1998), 325-336.
14. E. Israeli and R.K. Wood, Shortest-path network interdiction, Networks 40 (2002), 97-111.
15. D.S. Johnson, Efficient shortest path algorithms, J ACM 24 (1977), 1-13.
16. U. Pape, Implementation and efficiency of Moore-algorithms for the shortest route problem, Math Program 7 (1974), 212-222.
17. C. Wevley, The quickest path network interdiction problem, Masters Thesis, Operations Research Department, Naval Postgraduate School, Monterey, California, 1999.
18. W. Yurcik, D. Tipper, and D. Medhi, "The use of hop-limits to provide survivable ATM group communications," Proceedings of NGC 2000 on Networked Group Communication, Palo Alto, California, 8-10 November, 2000, pp. 131-140.