Finding the k shortest paths

SIAM Journal on Computing

Volumn 28, Issue 2, 1998, Pages 652-673

  Eppstein, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DYNAMIC PROGRAMMING; PROBLEM SOLVING;

KNAPSACK PROBLEMS; PATH ENUMERATION; SEQUENCE ALIGNMENT; SHORTEST PATHS;

GRAPH THEORY;

EID: 0032108018     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795290477     Document Type: Article

References (2)

1. A. AGGARWAL, B. SCHIEBER, AND T. TOKUYAMA, Finding a minimum weight K-link path in graphs with Monge property and applications, in Proc. 9th Symp. Computational Geometry, Assoc. for Computing Machinery, 1993, pp. 189-197.
2. R. K. AHUJA, K. MEHLHORN, J. B. ORLIN, AND R. E. TARJAN, Faster algorithms for the shortest path problem, J. Assoc. Comput. Mach., 37 (1990), pp. 213-223.