Faster Algorithms for the Shortest Path Problem (1990)

Cached

Download Links

by Ravindra K. Ahuja , Kurt Mehlhorn , James B. Orlin , Robert E. Tarjan
Venue:J. ASSOC. COMPUT. MACH
Citations:103 - 10 self

Active Bibliography

4 An Efficient Algorithm for the Shortest Path Problem – Diab Abuaiadh, Jeffrey H. Kingston - 1993
4 Buckets, Heaps, Lists, and Monotone Priority Queues – Boris Cherkassky, Krasikova St, Andrew V. Goldberg - 1997
4 Heap-on-Top Priority Queues – Boris V. Cherkassky, Andrew V. Goldberg - 1996
36 On the Inverse Shortest Path Problem – Didier Burton - 1993
3 Efficient Shortest Path Algorithms By Graph Decomposition – Diab Abuaiadh, Jeffrey H. Kingston - 1994
3 A Practical Shortest Path Algorithm with Linear Expected Time – Andrew V. Goldberg - 2001
59 Scaling Algorithms for Network Problems – Harold N. Gabow - 1985
20 Shortest Path Algorithms: Engineering Aspects – Andrew Goldberg - 2001
Development and Testing of Dynamic Traffic Assignment . . . – Hani S. Mahmassani, et al. - 1994
34 A Simple Shortest Path Algorithm with Linear Average Time – Andrew V. Goldberg
24 Improved shortest paths on the word RAM – Torben Hagerup, Fachbereich Informatik
26 Real-time Simulation of a Set Machine on a RAM – Robert Paige, Robert Paige - 1994
27 Integer Priority Queues with Decrease Key in . . . – Mikkel Thorup - 2003
2 Thin Heaps, Thick Heaps – Haim Kaplan, Robert E. Tarjan - 2006
Rank-Pairing Heaps – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
unknown title – Ulrich Meyer - 2001
Directed Single-Source Shortest-Paths in Linear Average-Case Time – Ulrich Meyer, Ulrich Meyer - 2001
Effiziente Algorithmen für ein Fahrplanauskunftsystem – Frank Schulz - 2000
28 Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time – Ulrich Meyer - 2001