Separating Hierarchical and General Hub Labelings

  • Andrew V. Goldberg
  • Ilya Razenshteyn
  • Ruslan Savchenko
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8087)

Abstract

In the context of distance oracles, a labeling algorithm computes vertex labels during preprocessing. An s,t query computes the corresponding distance using the labels of s and t only, without looking at the input graph. Hub labels is a class of labels that has been extensively studied. Performance of the hub label query depends on the label size. Hierarchical labels are a natural special kind of hub labels. These labels are related to other problems and can be computed more efficiently. This brings up a natural question of the quality of hierarchical labels. We show that there is a gap: optimal hierarchical labels can be polynomially bigger than the general hub labels. To prove this result, we give tight upper and lower bounds on the size of hierarchical and general labels for hypercubes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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
  2. 2.
    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
  3. 3.
    Babenko, M., Goldberg, A.V., Gupta, A., Nagarajan, V.: Algorithms for hub label optimization. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 69–80. Springer, Heidelberg (2013)Google Scholar
  4. 4.
    Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and Distance Queries via 2-hop Labels. SIAM Journal on Computing 32 (2003)Google Scholar
  5. 5.
    Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics. LNCS, vol. 5515, pp. 117–139. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269–271 (1959)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Fredman, M.L., Tarjan, R.E.: Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. J. Assoc. Comput. Mach. 34, 596–615 (1987)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance Labeling in Graphs. Journal of Algorithms 53, 85–112 (2004)CrossRefMATHGoogle Scholar
  9. 9.
    Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319–333. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  10. 10.
    Goldberg, A.V.: A Practical Shortest Path Algorithm with Linear Expected Time. SIAM Journal on Computing 37, 1637–1655 (2008)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)MATHGoogle Scholar
  12. 12.
    Peleg, D.: Proximity-preserving labeling schemes. Journal of Graph Theory 33(3), 167–176 (2000)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Thorup, M.: Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. J. Assoc. Comput. Mach. 46, 362–394 (1999)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Vazirani, V.V.: Approximation Algorithms. Springer (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Andrew V. Goldberg
    • 1
  • Ilya Razenshteyn
    • 2
  • Ruslan Savchenko
    • 3
  1. 1.Microsoft Research Silicon ValleyUSA
  2. 2.CSAILMITUK
  3. 3.Department of Mech. and Math.MSUUSA

Personalised recommendations