Algorithms for Hub Label Optimization

  • Maxim Babenko
  • Andrew V. Goldberg
  • Anupam Gupta
  • Viswanath Nagarajan
Conference paper

DOI: 10.1007/978-3-642-39206-1_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7965)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Maxim Babenko
    • 1
  • Andrew V. Goldberg
    • 2
  • Anupam Gupta
    • 3
    • 4
  • Viswanath Nagarajan
    • 5
  1. 1.Department of Mechanics and MathematicsMoscow State UniverityYandex
  2. 2.Microsoft Research Silicon ValleyUSA
  3. 3.Carnegie Mellon UniversityUSA
  4. 4.Microsoft Research SVCUSA
  5. 5.IBM T.J. Watson Research CenterUSA

Personalised recommendations