[1] |
Delling D, Sanders P, Schultes D, et al. Engineering route planning algorithms[M]//Algorithmics of large and complex networks. Springer Berlin Heidelberg, 2009: 117-139.
|
[2] |
Pohl I. Bi-directional and heuristic search in path problems[M]. Department of Computer Science, Stanford University, 1969.
|
[3] |
Gutman R J. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX 2004), 100-111.
|
[4] |
Goldberg A V, Harrelson C. Computing the shortest path: A search meets graph theory[C]//Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 2005: 156-165.
|
[5] |
Goldberg A V, Kaplan H, Werneck R F. Reach for A*: Efficient point-to-point shortest path algorithms[C]//IN WORKSHOP ON ALGORITHM ENGINEERING & EXPERIMENTS. 2006.
|
[6] |
9th DIMACS Implementation Challenge:http://www.dis.uniroma1.it/challenge9/download.shtml.
|
[7] |
Goldberg A V, Werneck R F F. Computing Point-to-Point Shortest Paths from External Memory[C]//ALENEX/ANALCO. 2005: 26-40.
|
[1] |
Delling D, Sanders P, Schultes D, et al. Engineering route planning algorithms[M]//Algorithmics of large and complex networks. Springer Berlin Heidelberg, 2009: 117-139.
|
[2] |
Pohl I. Bi-directional and heuristic search in path problems[M]. Department of Computer Science, Stanford University, 1969.
|
[3] |
Gutman R J. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX 2004), 100-111.
|
[4] |
Goldberg A V, Harrelson C. Computing the shortest path: A search meets graph theory[C]//Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 2005: 156-165.
|
[5] |
Goldberg A V, Kaplan H, Werneck R F. Reach for A*: Efficient point-to-point shortest path algorithms[C]//IN WORKSHOP ON ALGORITHM ENGINEERING & EXPERIMENTS. 2006.
|
[6] |
9th DIMACS Implementation Challenge:http://www.dis.uniroma1.it/challenge9/download.shtml.
|
[7] |
Goldberg A V, Werneck R F F. Computing Point-to-Point Shortest Paths from External Memory[C]//ALENEX/ANALCO. 2005: 26-40.
|