References

[1]

Abraham, Ittai, et al. “Highway dimension, shortest paths, and provably efficient algorithms.” Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2010.

[2]

Bast, Hannah, et al. “Route planning in transportation networks.” Algorithm engineering. Springer, Cham, 2016. 19-80.

[3]

Bast, Hannah. Lecture Notes from “Efficient Route Planning” . University of Freiburg, Freiburg Im Breisgau, Germany, 2012, ad-wiki.informatik.uni-freiburg.de/teaching/EfficientRoutePlanningSS2012.

[4]

Batz, G. Veit, et al. “Time-dependent contraction hierarchies.” Proceedings of the Meeting on Algorithm Engineering & Expermiments. Society for Industrial and Applied Mathematics, 2009.

[5]

Bauer, Reinhard, et al. “Preprocessing speed-up techniques is hard.” International Conference on Algorithms and Complexity. Springer, Berlin, Heidelberg, 2010.

[6]

Dibbelt, Julian, Ben Strasser, and Dorothea Wagner. “Customizable contraction hierarchies.” International Symposium on Experimental Algorithms. Springer, Cham, 2014.

[7]

Efentakis, Alexandros, Dieter Pfoser, and Agnès Voisard. “Efficient data management in support of shortest-path computation.” Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science. ACM, 2011.

[8]

Geisberger, Robert, et al. “Contraction hierarchies: Faster and simpler hierarchical routing in road networks.” International Workshop on Experimental and Efficient Algorithms. Springer, Berlin, Heidelberg, 2008.

[9]

Gesiberger, Robert. “Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.” Diploma Thesis at Institut Für Theoretische Informatik Universität Karlsruhe (TH), 1 July 2008.

[10]

Sanders, Peter, and Dominik Schultes. “Engineering fast route planning algorithms.” International Workshop on Experimental and Efficient Algorithms. Springer, Berlin, Heidelberg, 2007.

[11]

Sanders, Peter, and Dominik Schultes. “Engineering highway hierarchies.” European Symposium on Algorithms. Springer, Berlin, Heidelberg, 2006.

[12]

Schultes, Dominik, and Peter Sanders. “Dynamic highway-node routing.” International Workshop on Experimental and Efficient Algorithms. Springer, Berlin, Heidelberg, 2007.