Shortest Path Algorithms: Engineering Aspects (2001)

Cached

Download Links

by Andrew Goldberg
Venue:In Proc. ESAAC ’01, Lecture Notes in Computer Science
Citations:20 - 3 self

Documents Related by Co-Citation

1427 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
144 Shortest Paths Algorithms: Theory And Experimental Evaluation – Boris Cherkassky, Andrew V. Goldberg, Tomasz Radzik - 1993
34 A Simple Shortest Path Algorithm with Linear Average Time – Andrew V. Goldberg
58 Shortest path algorithms: An evaluation using real road networks – F. Benjamin Zhan, Charles E. Noon - 1998
92 Undirected single-source shortest paths with positive integer weights in linear time – M Thorup - 1999
28 Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time – Ulrich Meyer - 2001
57 Shortest path algorithms – G Gallo, S Pallottino - 1988
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
97 Computing the shortest path: A* search meets graph theory – Andrew V. Goldberg, Chris Harrelson - 2005
52 Reach-based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks – R Gutman
53 Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs – Dorothea Wagner, Thomas Willhalm - 2003
969 A formal basis for the heuristic determination of minimum cost paths – P E Hart, N J Nilsson, B Raphael - 1968
52 An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background – U Lauther - 2004
14 Implementations of Dijkstra's Algorithm Based on Multi-Level Buckets – Andrew V. Goldberg, Craig Silverstein - 1995
159 E cient algorithms for shortest paths in sparse networks – D B Johnson - 1977
22 Using multi-level graphs for timetable information – D W F Schulz, K Weihe - 2002
73 Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation – James R Driscoll, Harold N Gabow, Ruth Shrairman, Robert E Tarjan - 1988
13 A comparison between label-setting and label-correcting algorithms for computing one-to-one shortest paths – F B Zahn, C E Noon