1. H. Gonzalez, J. Han, X. Li, M. Myslinska and J. P. Sondag, “Adaptive fastest path computation on a road network: a traffic mining approach,” Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 794–805, Sept. 2007.
2. 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.
3. D. Wagner and T. Willhalm, “Geometric containers for efficient shortest-path computation,” ACM J. Exp. Algor., vol. 10, no. 1.3, pp. 1–30, 2005.
4. R. Möhring, H. Schilling, B. Schütz, D. Wagner and T. Willhalm, “Partitioning graphs to speed up Dijkstra’s algorithm,” ACM J. Exp. Algor., vol. 11, no. 2.8, pp. 1–29, 2007.
5. J. Maue, P. Sanders and D. Matijevic, “Goal directed shortest path queries using precomputed cluster distances,” ACM J. Exp. Algor., vol. 14, no. 2, pp. 3.2–3.27, 2010.