TY - GEN
T1 - On the complexity of hub labeling
AU - Babenko, Maxim
AU - Goldberg, Andrew V.
AU - Kaplan, Haim
AU - Savchenko, Ruslan
AU - Weller, Mathias
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2015.
PY - 2015
Y1 - 2015
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84944592593&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-48054-0_6
DO - 10.1007/978-3-662-48054-0_6
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84944592593
SN - 9783662480533
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 62
EP - 74
BT - Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Proceedings
A2 - Italiano, Giuseppe F.
A2 - Pighizzini, Giovanni
A2 - Sannella, Donald T.
PB - Springer Verlag
T2 - 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015
Y2 - 24 August 2015 through 28 August 2015
ER -