A Practical Shortest Path Algorithm with Linear Expected Time (2001)

by Andrew V. Goldberg
Venue:SUBMITTED TO SIAM J. ON COMPUTING
Citations:3 - 1 self

Documents Related by Co-Citation

2 Hierarchical Hub Labelings for Shortest Paths – I Abraham, D Delling, A V Goldberg, R F Werneck - 2012
5 A hub-based labeling algorithm for shortest paths in road networks – I Abraham, D Delling, A V Goldberg, R F Werneck - 2011
18 All-norm approximation algorithms – Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger - 2004
23 Engineering Route Planning Algorithms – Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner - 2009
72 On-Line Routing of Virtual Circuits with Applications to Load Balancing and Machine Scheduling – James Aspnes , Yossi Azar, Amos Fiat , Serge Plotkin, Orli Waarts - 1993
619 A Threshold of ln n for Approximating Set Cover – Uriel Feige - 1998
92 Undirected single-source shortest paths with positive integer weights in linear time – M Thorup - 1999
99 Distance Labeling in Graphs – Cyril Gavoille, David Peleg, Stéphane, Pérennes, Ran Raz - 2000
372 A greedy heuristic for the set-covering problem – V Chvátal - 1979
42 Generating Sparse 2-spanners – Guy Kortsarz, David Peleg - 1993
16 Convex programming for scheduling unrelated parallel machines – Yossi Azar, Amir Epstein
76 Reachability and Distance Queries via 2-Hop Labels – Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick - 2002
124 A fast parametric maximum flow algorithm and applications – G Gallo, M D Grigoriadis, R E Tarjan - 1989
32 Load balancing in the L_p norm – Baruch Awerbuch, Yossi Azar , Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter - 1995
6 A Unified Approach to Scheduling on Unrelated Parallel Machines – V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan - 2005
1 MSR-SVC) Shortest Paths and Experiments MIDAS, August 2010 123 / 123 Lauther. An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background – Renato Werneck
1 Time-dependent SHARC-routing – SIAM
1 Accelerating point-to-point shortest path computations in large scale networks – SIAM
1 Geoinformation und Mobilität - von der Forschung zur praktischen Anwendung, volume 22, pages 219–230. IfGI prints – In - 2004