Abstract

We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest paths from a given source s to each vertex in the graph, in total time O(m + n log n +kn). We describe applications to dynamic programming problems including the knapsack problem, sequence alignment, maximum inscribed polygons, and genealogical relationship discovery. 1 Introduction We consider a long-studied generalization of the shortest path problem, in which not one but several short paths must be produced. The k shortest paths problem is to list the k paths connecting a given source-destination pair in the digraph with minimum total length. Our techniques also apply to the problem of listing all paths shorter than some given threshhold length. In the version of these problems studi...

Citations

622	Flows in Networks - Ford, Fulkerson - 1962
557	Data structures and network algorithms - Tarjan - 1983
493	Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987
251	On a routing problem - Bellman - 1958
141	Trans-dichotomous algorithms for minimum spanning trees and shortest paths - Fredman, Willard - 1990
137	Faster shortestpath algorithms for planar graphs - Henzinger, Klein, et al. - 1997
121	Finding the k shortest loopless paths in a network - Yen - 1971
110	Sparsification — A technique for speeding up dynamic graph algorithms - Eppstein, Galil, et al. - 1997
91	Faster algorithms for the shortest path problem - Ahuja, Mehlhorn, et al.
79	An appraisal of some shortest path algorithms - Dreyfus - 1969
73	Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees - Frederickson - 1997
72	Disjoint paths in a network - Suurballe - 1974
61	A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem - Lawler - 1972
45	Scaling algorithms for the shortest paths problem - Goldberg - 1993
42	DB: A Priority Queue in Which Initialization and Queue Operations Take O(log log D) Time - Johnson - 1982
31	An efficient algorithm for k shortest simple paths - Katoh, Ibaraki, et al. - 1982
28	Improved sparsification - Eppstein, Galil, et al. - 1993
25	On near-optimal alignments of biological sequences - Naor, Brutlag - 1994
25	On algorithms for finding the k shortest paths in a network - Shier - 1979
22	Algorithms for proximity problems in higher dimensions - Dickerson, Eppstein - 1996
21	Finding a minimum-weight k-link path in graphs with concave Monge-property and applications - Aggarwal, Schiever, et al. - 1994
21	Finding two disjoint paths between two pairs of vertices in a graph - Shiloach, Perl - 1978
17	On finding single-source single-destination k shortest paths - Chong, Maddila, et al. - 1995
17	An optimal algorithm for selection in a min-heap - Frederickson - 1993
17	Algorithms for the quickest path problem and the enumeration of quickest paths - Rosen, Sun, et al. - 1991
16	MS: Sequence alignments in the neighborhood of the optimum with general application to dynamic programming - Waterman - 1983
15	A comparative study of k-shortest path algorithms - Brander, Sinclair - 1996
14	An algorithm for the ranking of shortest paths - Azevedo, Costa, et al. - 1993
14	An algorithm for ranking paths that may contain cycles - Martins - 1984
13	Determining all optimal and near-optimal solutions when solving shortest path problems by dynamic programming - Byers, Waterman - 1984
13	Interactive methods for determining the k shortest paths in a network - Shier - 1976
10	Solving k-shortest and constrained shortest path problems efficiently - Skicism, Golden - 1989
10	Data Structures and Network Algorithms CBMS-NSF - Tarjan - 1983
9	Implementation of algorithms for $ shortest loopless paths - Perko - 1986
9	Another algorithm for finding the k shortest loopless network paths - Yen - 1972
9	Computational experience with an algorithm for finding the k shortest paths in a network - Shier - 1974
8	Finding common ancestors and disjoint paths in DAGs - Eppstein - 1995
8	K-th shortest paths and applications to the probabilistic networks - FoX - 1975
7	Finding a Realistic Detour by AI Search Techniques - Shibuya, Ikeda, et al. - 1995
6	An ecient algorithm for k shortest simple paths - Katoh, Ibaraki, et al. - 1982
6	On computing sets of shortest paths in a graph - Minieka - 1974
6	Enumerating suboptimal alignments of multiple biological sequences efficiently - Shibuya, Imai - 1997
5	Finding the K quickest Simple paths in a Network - Chen - 1994
5	Comment on computing the k shortest paths in a graph - Lawler - 1977
4	Algorithms for the constrained quickest path problem and the enumeration of quickest paths - Chen, Hung - 1994
4	Computing k-shortest path for nuclear spent fuel highway transportation - Miaou, Chin - 1991
3	An algorithm for finding the k quickest paths in a network - Chen - 1993
3	and K Knight Unification-based glossing - Hatzivassiloglou - 1995
3	A note on an algebra for the k best routes in a network - Minieka, Shier - 1973
3	New flexible approaches for multiple sequence alignment - Shibuya, Imai - 1997