Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs (2003)

by Dorothea Wagner , Thomas Willhalm
Citations:53 - 14 self

Active Bibliography

2 Geometric Shortest Path Containers – Dorothea Wagner, Thomas Willhalm, Christos Zaroliagis - 2004
4 Point-to-Point Shortest Path Algorithms with Preprocessing – Andrew V. Goldberg
58 Reach for A∗: Efficient point-to-point shortest path algorithms – Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck - 2006
21 Combining Speed-Up Techniques for Shortest-Path Computations – Martin Holzer, Frank Schulz, Thomas Willhalm - 2004
1 M.: Memory-efficient a*-search using sparse embeddings – Franz Graf, Hans-peter Kriegel, Matthias Renz, Matthias Schubert - 2010
12 Speed-Up Techniques for Shortest-Path Computations – Dorothea Wagner, Thomas Willhalm - 2007
12 A shortest path algorithm for real-weighted undirected graphs – Seth Pettie, Vijaya Ramachandran - 1985
2 Average-Case Complexity of Shortest-Paths Problems – Volker Priebe, Der Naturwissenschaftlich-technischen Fakultät I, Dekan Prof, Dr. Rainer Schulze-pillot-ziemen, Gutachter Prof, Dr. Kurt Mehlhorn, Prof Alan Frieze, Ph. D
10 A Faster All-pairs Shortest Path Algorithm for Real-weighted Sparse Graphs – Seth Pettie - 2002
3 A Practical Shortest Path Algorithm with Linear Expected Time – Andrew V. Goldberg - 2001
2 Generating node coordinates for shortest-path computations in transportation networks – Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
Maximum Gain Round Trips with Cost Constraints – Franz Graf, Hans-peter Kriegel, Matthias Schubert - 1105
Directed Single-Source Shortest-Paths in Linear Average-Case Time – Ulrich Meyer, Ulrich Meyer - 2001
20 Shortest Path Algorithms: Engineering Aspects – Andrew Goldberg - 2001
12 Experimental Evaluation of a New Shortest Path Algorithm (Extended Abstract) – Seth Pettie, Vijaya Ramachandran, Srinath Sridhar - 2002
25 Using Multi-level Graphs for Timetable Information in Railway Systems – Frank Schulz, Dorothea Wagner, Christos Zaroliagis - 2002
2 Travel Planning With Self-Made Maps – Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm - 2001
1 A Generalization of Dijkstra’s Shortest Path Algorithm with Applications to VLSI Routing – Sven Peyer, Dieter Rautenbach, Jens Vygen
Partition-Based Speed-Up of Dijkstra’s Algorithm – Birk Schütz