Computing point-to-point shortest paths from external memory

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2005, Pages 26-40

  Goldberg, Andrew V ^a   Werneck, Renato F ^b  

^a MICROSOFT RESEARCH   (United States)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALT ALGORITHM; MEMORY CARD;

ALGORITHMS; COMPUTATIONAL METHODS; FLASH MEMORY; PROGRAM PROCESSORS;

PROBLEM SOLVING;

EID: 32144437248     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (42)

1. E. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. Wiley, 1997.
2. L. Arge, U. Meyer, and L. Toma. External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. In J. Diaz, J. Karhumäki, A. Leistö, and D. Sannella, editors, Proc. 31st International Colloquim on Automata, Languages, and Programming, volume 3142 of Lecture Notes in Computer Science, pages 146-157. Springer-Verlag, 2004.
3. G. S. Brodal, R. Fagerberg, U. Meyer, and N. Zeh. Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. In T. Hagerup and J. Katajainen, editors, Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 480-492. Springer-Verlag, 2004.
4. B. V. Cherkassky, A. V. Goldberg, and T. Radzik. Shortest Paths Algorithms: Theory and Experimental Evaluation. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pages 516-525, 1994.
5. L. J. Cowen and C. G. Wagner. Compact Roundtrip Routing in Directed Networks. In Proc. Symp. on Principles of Distributed Computation, pages 51-59, 2000.
6. G. B. Dantzig. Linear Programming and Extensions. Princeton Univ. Press, Princeton, NJ, 1962.
7. E. V. Denardo and B. L. Fox. Shortest-Route Methods: 1. Reaching, Pruning, and Buckets, Oper. Res., 27:161-186, 1979.
8. E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numer. Math., 1:269-271, 1959.
9. J. Doran, An Approach to Automatic Problem-Solving. Machine Intelligence, 1:105-127, 1967.
10. D. Dreyfus. An Appraisal of Some Shortest Path Algorithms. Technical Report RM-5433, Rand Corporation, Santa Monica, CA, 1967.
11. J. Fakcharoenphol and S. Rao. Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time, In Proc. 42nd IEEE Annual Symposium on Foundations of Computer Science, pages 232-241, 2001.
12. L. R. Ford, Jr. Network Flow Theory. Technical Report P-932, The Rand Corporation, 1956.
13. L. R. Ford, Jr. and D. R. Fulkerson. Flows in Networks. Princeton Univ. Press, Princeton, NJ, 1962.
14. P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, and Y. Shavit, IDMaps: A Global Internet Host Distance Estimation Service. IEEE/ACM Trans. on Networking, 2001.
15. M. L. Fredman and R. E. Tarjan. Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. J. Assoc. Comput. Mach., 34:596-615, 1987.
16. G. Gallo and S. Pallottino. Shortest Paths Algorithms. Annals of Oper. Res., 13:3-79, 1988.
17. A. V. Goldberg. A Simple Shortest Path Algorithm with Linear Average Time. In Proc. 9th Annual European Symposium on Algorithms, volume 2161 of Lecture Notes in Computer Science, pages 230-241, Springer-Verlag, 2001.
18. A. V. Goldberg. Shortest Path Algorithms: Engineering Aspects. In Proc. ESAAC '01, Lecture Notes in Computer Science. Springer-Verlag, 2001.
19. A. V. Goldberg and C. Harrelson. Computing the Shortest Path: A* Search Meets Graph Theory. Technical Report MSR-TR-2004-24, Microsoft Research, 2004.
20. A. V. Goldberg and C. Silverstein. Implementations of Dijkstra's Algorithm Based on Multi-Level Buckets. In P. M. Pardalos, D. W. Hearn, and W. W. Hages, editors, Lecture Notes in Economics and Mathematical Systems 450 (Refereed Proceedings), pages 292-327. Springer Verlag, 1997.
21. R. Gutman. Reach-based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In Proc. 6th International Workshop on Algorithm Engineering and Experiments, pages 100-111, 2004.
22. P. E. Hart, N. J. Nilsson, and B. Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on System Science and Cybernetics, SSC-4(2), 1968.
23. D. Hutchinson, A. Maheshwari, and N. Zeh. An external memory data structure for shortest path queries. DAM, 126:55-82, 2003.
24. T. Ikeda, Min-Yao Hsu, H. Imai, S. Nishimura, H. Shimoura, T. Hashimoto, K. Tenmoku, and K. Mitoh. A Fast Algorithm for Finding Better Routes by AI Search Techniques. In Proc. Vehicle Navigation and Information Systems Conference. IEEE, 1994.
25. R. Jacob, M. V. Marathe, and K. Nagel. A Computational Study of Routing Algorithms for Realistic Transportation Networks. Oper. Res., 10:476-499, 1962.
26. P. Klein. Preprocessing an Undirected Planar Network to Enable Fast Approximate Distance Queries. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, pages 820-827, 2002.
27. J. Kleinberg, A. Slivkins, and T. Wexler. Triangulation and embedding using small sets of beacons. In Proc. 45th IEEE Symposium on Foundations of Computer Science, pages 444-453, 2004.
28. U. Lauther. 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), pages 219-230, 2004.
29. M. Matsumoto and T. Nishimura. Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudorandom Number Generator. ACM Transactions on Modeling and Computer Simulation, 8(1):3-30, 1998.
30. U. Meyer. Single-Source Shortest Paths on Arbitrary Directed Graphs in Linear Average Time. In Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, pages 797-806, 2001.
31. U. Meyer and N. Zeh. I/O-Efficient Undirected Shortest Paths. In G. Di Battista and U. Zwick, editors, Proc. 11th European Symp. on Algorithms, volume 2832 of Lecture Notes in Computer Science, pages 434-445. Springer-Verlag, 2003.
32. E. Ng and H. Zhang. Predicting internet network distance with coordinates-based approach. In IEEE INFOCOM, 2002.
33. T. A. J. Nicholson. Finding the Shortest Route Between Two Points in a Network. Computer J., 9:275-280, 1966.
34. I. Pohl, Bi-directional Search. In Machine Intelligence, volume 6, pages 124-140, Edinburgh Univ. Press, Edinburgh, 1971.
35. F. Schulz, D. Wagner, and K. Weihe. Using Multi-Level Graphs for Timetable Information. In Proc. 4th International Workshop on Algorithm Engineering and Experiments, volume 2409 of Lecture Notes in Computer Science, pages 43-59. Springer-Verlag, 2002.
36. R. Sedgewick and J. S. Vitter. Shortest Paths in Euclidean Graphs. Algorithmica, 1:31-48, 1986.
37. R. E. Tarjan, Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
38. M. Thorup. Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. J. Assoc. Comput. Mach., 46:362-394, 1999.
39. M. Thorup. Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. In Proc. 42nd IEEE Annual Symposium on Foundations of Computer Science, pages 242-251, 2001.
40. D. Wagner and T. Willhalm. Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. In Proc. 11th Annual European Symposium on Algorithms, volume 2832 of Lecture Notes in Computer Science, pages 776-787. Springer-Verlag, 2003.
41. F. B. Zhan and C. E. Noon. Shortest Path Algorithms: An Evaluation Using Real Road Networks, Transp. Sci., 32:65-73, 1998.
42. F. B. Zhan and C. E. Noon. 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.