@inproceedings{dd06cdcb7862445c88dcf847924948c9,
title = "On the complexity of hub labeling",
abstract = "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.",
author = "Maxim Babenko and Goldberg, {Andrew V.} and Haim Kaplan and Ruslan Savchenko and Mathias Weller",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2015.; 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015 ; Conference date: 24-08-2015 Through 28-08-2015",
year = "2015",
doi = "10.1007/978-3-662-48054-0_6",
language = "الإنجليزيّة",
isbn = "9783662480533",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "62--74",
editor = "Italiano, {Giuseppe F.} and Giovanni Pighizzini and Sannella, {Donald T.}",
booktitle = "Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Proceedings",
}