Advertisement

Algorithms for Hub Label Optimization

  • Maxim Babenko
  • Andrew V. Goldberg
  • Anupam Gupta
  • Viswanath Nagarajan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7965)

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.

Keywords

Short Path Relevant Element Unrelated Parallel Machine Label Size Distance Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230–241. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  2. 2.
    Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical Hub Labelings for Shortest Paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24–35. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  3. 3.
    Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: A unified approach to scheduling on unrelated parallel machines. JACM 56(5), 28–31 (2009)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486–504 (1997)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Awerbuch, B., Azar, Y., Grove, E.F., Kao, M.-Y., Krishnan, P., Vitter, J.S.: Load balancing in the lp norm. In: FOCS, pp. 383–391 (1995)Google Scholar
  6. 6.
    Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: STOC 2005, pp. 331–337 (2005)Google Scholar
  7. 7.
    Azar, Y., Epstein, L., Richter, Y., Woeginger, G.J.: All-norm approximation algorithms. J. Algorithms 52(2), 120–133 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Chvátal, V.: A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research 4(3), 233–235 (1979)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and Distance Queries via 2-hop Labels. SIAM J. Comput. 32 (2003)Google Scholar
  10. 10.
    Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics. LNCS, vol. 5515, pp. 117–139. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.
    Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998)MathSciNetzbMATHGoogle Scholar
  12. 12.
    Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A Fast Parametric Maximum Flow Algorithm and Applications. SIAM J. Comput. 18, 30–55 (1989)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance Labeling in Graphs. Journal of Algorithms 53, 85–112 (2004)zbMATHCrossRefGoogle Scholar
  14. 14.
    Goldberg, A.V.: A Practical Shortest Path Algorithm with Linear Expected Time. SIAM Journal on Computing 37, 1637–1655 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Kortsarz, G., Peleg, D.: Generating Sparse 2-Spanners. J.Alg. 17, 222–236 (1994)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Thorup, M.: Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. JACM 46, 362–394 (1999)MathSciNetzbMATHCrossRefGoogle Scholar

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