Recent results on the single-source shortest paths problem

@article{Raman1997RecentRO,
  title={Recent results on the single-source shortest paths problem},
  author={R. Raman},
  journal={SIGACT News},
  year={1997},
  volume={28},
  pages={81-87}
}
  • R. Raman
  • Published 1997
  • Mathematics, Computer Science
  • SIGACT News
  • We summarize the currently best known theoretical results for the single-source shortest paths problem for directed graphs with non-negative edge weights. We also point out that a recent result due to Cherkassky, Goldberg and Silverstein (1996) leads to even better time bounds for this problem than claimed by the authors. 
    81 Citations

    Topics from this paper

    Exact and Approximate Distances in Graphs - A Survey
    • 173
    A Simple Shortest Path Algorithm with Linear Average Time
    • 88
    • Highly Influenced
    Undirected single-source shortest paths with positive integer weights in linear time
    • M. Thorup
    • Mathematics, Computer Science
    • JACM
    • 1999
    • 392
    • PDF
    Directed single-source shortest-paths in linear average-case time
    • 1
    Shortest path algorithm with pre-calculated single link failure recovery for non-negative weighted undirected graphs
    • 5
    Undirected single source shortest paths in linear time
    • M. Thorup
    • Mathematics, Computer Science
    • Proceedings 38th Annual Symposium on Foundations of Computer Science
    • 1997
    • 100
    Shortest Path Algorithms: Engineering Aspects
    • 58
    • Highly Influenced
    • PDF
    A New Single-Source Shortest Path Algorithm for Nonnegative Weight Graph
    • 1
    • PDF
    A Shortest Path Algorithm for Real-Weighted Undirected Graphs
    • 76
    • PDF
    A near linear shortest path algorithm for weighted undirected graphs
    • 1

    References

    On RAM priority queues
    • M. Thorup
    • Computer Science, Mathematics
    • SODA '96
    • 1996
    • 169
    • Highly Influential