Improved algorithms for the k simple shortest paths and the replacement paths problems

Information Processing Letters

Volumn 109, Issue 7, 2009, Pages 352-355

  Gotthilf, Zvi ^a   Lewenstein, Moshe ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Algorithms; k simple shortest paths; Replacement paths; Shortest paths; Weighted directed graphs

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROGRAMMING THEORY;

BEST-KNOWN ALGORITHMS; IMPROVED ALGORITHMS; K SIMPLE SHORTEST PATHS; REPLACEMENT PATHS; RUNNING TIME; RUNNING-IN; SHORTEST PATHS; SIMPLE ALGORITHMS; SPARSE GRAPHS; UNWEIGHTED DIRECTED GRAPHS; USEFUL PROPERTIES; WEIGHTED DIRECTED GRAPHS; WEIGHTED GRAPHS;

WIRELESS SENSOR NETWORKS;

EID: 59349087470     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.12.015     Document Type: Article

References (11)

1. T.M. Chan, More algorithms for all-pairs shortest paths in weighted graphs, in: Proc. of Symposium on Theory of Computing (STOC), 2007, pp. 590-598
2. Dijkstra E. A note on two problems in connexion with graphs. Mathematik 1 (1959) 269-271
3. Eppstein D. Finding the k shortest paths. SIAM Journal on Computing 28 2 (1998) 652-673
4. Fredman M., and Tarjan R. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (1987) 596-615
5. Katoh N., Ibaraki T., and Mine H. An efficient algorithm for k shortest simple paths. Networks 12 4 (1982) 411-427
6. Lawler E.L. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science 18 (1971/72) 401-405
7. Malik K., Mittal A.K., and Gupta S.K. The k most vital arcs in the shortest path problem. Operations Research Letters 8 4 (1989) 223-227
8. Pettie S. A new approach to all pairs shortest paths on real-weighted graphs. Theoretical Computer Science 312 1 (2004) 47-74
9. L. Roditty, On the k-simple shortest paths problem in weighted directed graphs, in: Proc. of Symposium on Discrete Algorithms (SODA), 2007, pp. 920-928
10. L. Roditty, U. Zwick, Replacement paths and k simple shortest paths in unweighted directed graphs, in: Proc. of International Conference on Automata, Languages and Programming (ICALP), 2005, pp. 249-260
11. Yen J.Y. Finding the k shortest loopless paths in a network. Management Science 17 (1970/71) 249-260