Hub Label Compression

  • Daniel Delling
  • Andrew V. Goldberg
  • Renato F. Werneck
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7933)


The hub labels (HL) algorithm is the fastest known technique for computing driving times on road networks, but its practical applicability can be limited by high space requirements relative to the best competing methods. We develop compression techniques that substantially reduce HL space requirements with a small performance penalty.


Road Network Query Time Space Usage Local Query Random Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Project OSRM (2012),
  2. 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)Google Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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)CrossRefGoogle Scholar
  5. 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)Google Scholar
  6. 6.
    Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast Routing in Road Networks with Transit Nodes. Science 316(5824), 566 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. ACM JEA 14(2.4), 1–29 (2009)MathSciNetGoogle Scholar
  8. 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)MathSciNetGoogle Scholar
  9. 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)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2001)Google Scholar
  11. 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)CrossRefGoogle Scholar
  12. 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)Google Scholar
  13. 13.
    Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: 9th DIMACS Implementation Challenge. DIMACS Book, vol. 74. AMS (2009)Google Scholar
  14. 14.
    Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269–271 (1959)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance Labeling in Graphs. Journal of Algorithms 53, 85–112 (2004)zbMATHCrossRefGoogle Scholar
  16. 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)CrossRefGoogle Scholar
  17. 17.
    Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: Proc. SODA 2005, pp. 156–165. SIAM (2005)Google Scholar
  18. 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–139Google Scholar
  19. 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–40Google Scholar
  20. 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)Google Scholar
  21. 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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Daniel Delling
    • 1
  • Andrew V. Goldberg
    • 1
  • Renato F. Werneck
    • 1
  1. 1.Microsoft Research Silicon ValleyUSA

Personalised recommendations