Algorithms for Hub Label Optimization
- Cite this paper as:
- Babenko M., Goldberg A.V., Gupta A., Nagarajan V. (2013) Algorithms for Hub Label Optimization. In: Fomin F.V., Freivalds R., Kwiatkowska M., Peleg D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7965. Springer, Berlin, Heidelberg
We consider the problem of approximating optimal hub labelings in the context of labeling algorithms for the shortest path problem. A previous result was a O(logn) approximating for minimizing the total label size. We give an O(logn)-approximation algorithm for the maximum label size. We also give O(logn)-approximation algorithms for natural generalizations of the problem: Minimizing an ℓp norm of the labeling and simultaneously minimizing ℓp and ℓq norms.
Unable to display preview. Download preview PDF.