On the complexity of hub labeling

Maxim Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko*, Mathias Weller

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Proceedings
EditorsGiuseppe F. Italiano, Giovanni Pighizzini, Donald T. Sannella
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783662480533
StatePublished - 2015
Event40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015 - Milan, Italy
Duration: 24 Aug 201528 Aug 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015


Dive into the research topics of 'On the complexity of hub labeling'. Together they form a unique fingerprint.

Cite this