Hub label compression

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

Volumn 7933 LNCS, Issue , 2013, Pages 18-29

  Delling, Daniel ^a   Goldberg, Andrew V ^a   Werneck, Renato F ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION TECHNIQUES; PERFORMANCE PENALTIES; ROAD NETWORK; SPACE REQUIREMENTS;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

ALGORITHMS;

EID: 84884400100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38527-8_4     Document Type: Conference Paper

References (21)

1. Project OSRM (2012), http://project-osrm.org/
2. Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: HLDB: Location-Based Services in Databases. In: Proc. SIGSPATIAL GIS, pp. 339-348. ACM Press (2012)
3. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230-241. Springer, Heidelberg (2011)
4. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical Hub Labelings for Shortest Paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24-35. Springer, Heidelberg (2012)
5. Arz, J., Luxen, D., Sanders, P.: Transit Node Routing Reconsidered. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 55-66. Springer, Heidelberg (2013)
6. Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast Routing in Road Networks with Transit Nodes. Science 316(5824), 566 (2007)
7. Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. ACM JEA 14(2.4), 1-29 (2009)
8. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. ACM JEA 15(2.3), 1-31 (2010)
9. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and Distance Queries via 2-Hop Labels. SIAM J. Computing 32(5), 1338-1355 (2003)
10. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2001)
11. Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable Route Planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 376-387. Springer, Heidelberg (2011)
12. Delling, D., Werneck, R.F.: Faster Customization of Road Networks. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 30-42. Springer, Heidelberg (2013)
13. Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: 9th DIMACS Implementation Challenge. DIMACS Book, vol. 74. AMS (2009)
14. Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269-271 (1959)
15. Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance Labeling in Graphs. Journal of Algorithms 53, 85-112 (2004)
16. Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transportation Sci. 46(3), 388-404 (2012)
17. Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: Proc. SODA 2005, pp. 156-165. SIAM (2005)
18. Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Shortest Path Algorithms with Preprocessing. In: Demetrescu, et al. (eds.) [13], pp. 93-139
19. Lauther, U.: An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Roadnetworks with Precalculated Edge-Flags. In: Demetrescu, et al. (eds.) [13], pp. 19-40
20. Munro, I., Rao, S.: Succinct representation of data structures. In: Mehta, D.P., Sahni, S. (eds.) Handbook of Data Structures and Applications. CRC (2004)
21. Sanders, P., Schultes, D., Vetter, C.: Mobile Route Planning. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 732-743. Springer, Heidelberg (2008)