A Lazy Version of Eppstein's K Shortest Paths Algorithm

@inproceedings{Jimnez2003ALV,
  title={A Lazy Version of Eppstein's K Shortest Paths Algorithm},
  author={V{\'i}ctor M. Jim{\'e}nez and A. Marzal},
  booktitle={WEA},
  year={2003}
}
  • Víctor M. Jiménez, A. Marzal
  • Published in WEA 2003
  • Computer Science, Mathematics
  • We consider the problem ofen umerating, in order ofin - creasing length, the K shortest paths between a given pair ofno des in a weighted digraph G with n nodes and m arcs. To solve this problem, Eppstein's algorithm first computes the shortest path tree and then builds a graph D(G) representing all possible deviations from the shortest path. Building D(G) takes O(m+n log n) time in the basic version ofthe algorithm. Once it has been built, the K shortest paths can be obtained in order ofin… CONTINUE READING
    A NEW O(m+ kn log d) ALGORITHM TO FIND THE k SHORTEST PATHS IN ACYCLIC DIGRAPHS
    • 1
    • Highly Influenced
    • PDF
    K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
    • 15
    • PDF
    Finding the k shortest simple paths
    • 227
    • PDF
    K* : heuristics-guided, on-the-fly k shortest paths search
    • 1
    • PDF
    K⁎: A heuristic search algorithm for finding the k shortest paths
    • 116
    • Highly Influenced
    • PDF
    Top-k Shortest Paths in Directed Labeled Multigraphs
    • 7
    • PDF
    Optimizing multi-criteria k-shortest paths in graph by a natural routing genotype-based genetic algorithm

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 17 REFERENCES
    Finding the k Shortest Paths
    • 871
    • PDF
    A New Shortest Paths Ranking Algorithm
    • 33
    Resource Constrained Shortest Paths
    • 132
    • PDF
    An Appraisal of Some Shortest-Path Algorithms
    • 964
    Iterative methods for determining the k shortest paths in a network
    • D. Shier
    • Mathematics, Computer Science
    • 1976
    • 104
    • PDF