International Symposium on Mathematical Foundations of Computer Science

MFCS 2015: Mathematical Foundations of Computer Science 2015 pp 62-74

On the Complexity of Hub Labeling (Extended Abstract)

  • Maxim Babenko
  • Andrew V. Goldberg
  • Haim Kaplan
  • Ruslan Savchenko
  • Mathias Weller
Conference paper

DOI: 10.1007/978-3-662-48054-0_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9235)
Cite this paper as:
Babenko M., Goldberg A.V., Kaplan H., Savchenko R., Weller M. (2015) On the Complexity of Hub Labeling (Extended Abstract). In: Italiano G., Pighizzini G., Sannella D. (eds) Mathematical Foundations of Computer Science 2015. MFCS 2015. Lecture Notes in Computer Science, vol 9235. Springer, Berlin, Heidelberg


Hub Labeling (HL) is a data structure for distance oracles. Hierarchical HL (HHL) is a special type of HL, that received a lot of attention from a practical point of view. However, theoretical questions such as NP-hardness and approximation guarantees for HHL algorithms have been left aside. We study the computational complexity of HL and HHL. We prove that both HL and HHL are NP-hard, and present upper and lower bounds on the approximation ratios of greedy HHL algorithms that are used in practice. We also introduce a new variant of the greedy HHL algorithm that produces small labels for graphs with small highway dimension.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Maxim Babenko
    • 1
  • Andrew V. Goldberg
    • 2
  • Haim Kaplan
    • 3
  • Ruslan Savchenko
    • 4
  • Mathias Weller
    • 5
  1. 1.Yandex and Higher School of EconomicsMoscowRussia
  2., Inc.E. Palo AltoUSA
  3. 3.School of Computer ScienceTel Aviv UniversityTel Aviv-YafoIsrael
  4. 4.YandexMoscowRussia
  5. 5.LIRMMUniversité Montpellier IIMontpellierFrance

Personalised recommendations