Point-to-point shortest path algorithms with preprocessing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4362 LNCS, Issue , 2007, Pages 88-102

  Goldberg, Andrew V ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

REACH-BASED ALGORITHMS; SHORTEST PATH ALGORITHMS; THEORETICAL BOUNDS;

ALGORITHMS;

EID: 38149051231     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69507-3_6     Document Type: Conference Paper

References (42)

1. Cherkassky, B.V., Goldberg, A.V., and Radzik, T.: Shortest Paths Algorithms: Theory and Experimental Evaluation. Math. Prog. 73 (1996) 129-174
2. Cowen, L.J. and Wagner, C.G.: Compact Roundtrip Routing in Directed Networks. In Proc. Symp. on Principles of Distributed Computation (2000) 51-59
3. Dantzig, G.B.: Linear Programming and Extensions. Princeton Univ. Press, Princeton, NJ (1962)
4. Denardo, E.V. and Fox, B.L.: Shortest-Route Methods: 1. Reaching, Pruning, and Buckets. Oper. Res. 27 (1979) 161-186
5. Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numer. Math. 1 (1959) 269-271
6. J. Doran. An Approach to Automatic Problem-Solving. Machine Intelligence 1 (1967) 105-127
7. Dreyfus, D.: An Appraisal of Some Shortest Path Algorithms. Technical Report RM-5433, Rand Corporation, Santa Monica, CA (1967)
8. Fakcharoenphol, J. and Rao, S.: Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time. In Proc. 42nd IEEE Annual Symposium on Foundations of Computer Science (2001) 232-241
9. Fredman, M.L. and Tarjan, R.E.: Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. J. Assoc. Comput. Mach. 34 (1987) 596-615
10. Gallo, G. and Pallottino, S.: Shortest Paths Algorithms. Annals of Oper. Res. 13 (1988) 3-79
11. Goldberg, A.V.: A Simple Shortest Path Algorithm with Linear Average Time. In Proc. 9th ESA, Springer-Verlag, Lecture Notes in Computer Science LNCS 2161, (2001) 230-241
12. Goldberg, A.V.: Shortest Path Algorithms: Engineering Aspects. In Proc. ESAAC '01, Lecture Notes in Computer Science, Springer-Verlag (2001)
13. Goldberg, A.V. and Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. Technical Report MSR-TR-2004-24, Microsoft Research (2004)
14. Goldberg, A.V. and Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (2005) 156-165
15. Goldberg, A.V., Kaplan, H., and Werneck, R.F.: Better Landmarks within Reach. In The 9th DIMACS Implementation Challenge: Shortest Paths (2006)
16. Goldberg, A.V., Kaplan, H. and Werneck R.F.: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. In Proc. 7th International Workshop on Algorithm Engineering and Experiments, SIAM (2006)
17. Goldberg A.V. and Silverstein, C.: Implementations of Dijkstra's Algorithm Based on Multi-Level Buckets. In P. M. Pardalos, D. W. Hearn, and W. W. Hages (eds), Springer Verlag, Lecture Notes in Economics and Mathematical Systems 450 (Refereed Proceedings) (1997) 292-327
18. Goldberg, A.V. and Werneck, R.F.: Computing Point-to-Point Shortest Paths from External Memory. In Proc. 7th International Workshop on Algorithm Engineering and Experiments, SIAM (2005) 26-40
19. Gutman, R.: Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In Proc. 6th International Workshop on Algorithm Engineering and Experiments (2004) 100-111
20. Hart, P.E., Nilsson, N.J., and Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on System Science and Cybernetics, SSC-4(2) (1968)
21. Ikeda, T., Hsu M.-Y., Imai, H., Nishimura, S., Shimoura, H., Hashimoto, T., Tenmoku, K., and Mitoh, K.: A Fast Algorithm for Finding Better Routes by AI Search Techniques. In Proc. Vehicle Navigation and Information Systems Conference, IEEE (1994)
22. Jacob, R., Marathe, M.V., and Nagel, K.: A Computational Study of Routing Algorithms for Realistic Transportation Networks. Oper. Res. 10 (1962) 476-499
23. Klein, P.: Preprocessing an Undirected Planar Network to Enable Fast Approximate Distance Queries. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (2002) 820-827
24. Köhler, E., Möhring, R.H., and Schilling, H.: Acceleration of Shortest Path and Constrained Shortest Path Computation. In WEA (2005) 126-138
25. Ford, Jr. L.R.: Network Flow Theory. Technical Report P-932, The Rand Corporation (1956)
26. Ford, Jr. L.R. and Fulkerson, D.R.: Flows in Networks. Princeton Univ. Press, Princeton, NJ (1962)
27. Lauther, U.: An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In IfGIprints 22, Institut fuer Geoinformatik, Universitaet Muenster (ISBN 3-936616-22-1) (2004) 219-230
28. Meyer, U.: Single-Source Shortest Paths on Arbitrary Directed Graphs in Linear Average Time. In Proc. 12th ACM-SIAM Symposium on Discrete Algorithms (2001) 797-806
29. Möhring, R.H., Schilling, H., Schütz, B., Wagner, D., and Willhalm, T.: Partitioning Graphs to Speed up Dijkstra's Algorithm. In WEA (2005) 189-202
30. Nicholson, T.A.J.: Finding the Shortest Route Between Two Points in a Network. Computer J. 9 (1966) 275-280
31. Pohl, I.: Bi-Directional Search. In Machine Intelligence, Edinburgh Univ. Press, Edinburgh 6 (1971) 124-140
32. Sanders, P. and Schultes, D.: Fast and Exact Shortest Path Queries Using Highway Hierarchies. In Proc. 13th Annual European Symposium Algorithms (2005)
33. Sanders, P. and Schultes, D.: Engineering Highway Hierarchies. In Proc. 14th Annual European Symposium Algorithms (2006)
34. Schultes, D.: Fast and Exact Shortest Path Queries Using Highway Hierarchies. Master's Thesis, Department of Computer Science, Universitt des Saarlandes, Germany (2005)
35. Schulz, F., Wagner, D., and Weihe, K.: Using Multi-Level Graphs for Timetable Information. In Proc. 4th International Workshop on Algorithm Engineering and Experiments, LNCS, Springer (2002) 43-59
36. Sedgewick, R. and Vitter, J.S.: Shortest Paths in Euclidean Graphs. Algorithmica 1 (1986) 31-48
37. Tarjan, R.E.: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA (1983)
38. Thorup, M.: Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. J. Assoc. Comput. Mach. 46 (1999) 362-394
39. Thorup, M.: Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. In Proc. 42nd IEEE Annual Symposium on Foundations of Computer Science (2001) 242-251
40. Wagner, D. and Willhalm, T.: Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. In European Symposium on Algorithms (2003)
41. Zhan, F.B. and Noon, C.E.: Shortest Path Algorithms: An Evaluation Using Real Road Networks. Transp. Sci. 32 (1998) 65-73
42. Zhan, F.B. and Noon, C.E.: A Comparison Between Label-Setting and Label-Correcting Algorithms for Computing One-to-One Shortest Paths. Journal of Geographic Information and Decision Analysis 4 (2000)