Faster algorithms for the shortest path problem

  title={Faster algorithms for the shortest path problem},
  author={R. Ahuja and K. Mehlhorn and J. Orlin and R. Tarjan},
  journal={J. ACM},
  • R. Ahuja, K. Mehlhorn, +1 author R. Tarjan
  • Published 1990
  • Mathematics, Computer Science
  • J. ACM
  • Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the <italic>radix heap</italic>, is proposed for use in this algorithm. On a network with <italic>n</italic> vertices, <italic>m</italic> edges, and nonnegative integer arc costs bounded by <italic>C</italic>, a one-level form of radix heap gives a time bound for Dijkstra's algorithm of <italic>O</italic>(<italic>m</italic> + <italic>n</italic> log <italic>C</italic>). A two-level form… CONTINUE READING
    494 Citations

    Topics from this paper

    Finding minimum-cost circulations by canceling negative cycles
    • 137
    Finding minimum-cost circulations by canceling negative cycles
    • 212
    • PDF
    Computing shortest paths with comparisons and additions
    • 68
    • PDF
    Improved Shortest Path Algorithms for Nearly Acyclic Graphs
    • 10
    • PDF
    Improved shortest path algorithms for nearly acyclic graphs
    • 16
    All-pairs shortest paths for unweighted undirected graphs in o(mn) time
    • T. Chan
    • Mathematics, Computer Science
    • TALG
    • 2012
    • 64
    • PDF
    A Novel Linear Algorithm for Shortest Paths in Networks
    • 3
    An improved Dijkstra's shortest path algorithm for sparse network
    • 76


    Efficient special-purpose priority queues
    • In Proceedings of the 15th Annual Allerton Conference on Communications, Control, and Computing
    • 1977