Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location

  • Jaroslaw Byrka
  • Bartosz Rybicki
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7391)

Abstract

We study the k-level uncapacitated facility location problem, where clients need to be connected with paths crossing open facilities of k types (levels). In this paper we give an approximation algorithm that for any constant k, in polynomial time, delivers solutions of cost at most α k times OPT, where α k is an increasing function of k, with lim k → ∞  α k  = 3.

Our algorithm rounds a fractional solution to an extended LP formulation of the problem. The rounding builds upon the technique of iteratively rounding fractional solutions on trees (Garg, Konjevod, and Ravi SODA’98) originally used for the group Steiner tree problem.

We improve the approximation ratio for k-UFL for all k ≥ 3, in particular we obtain the ratio equal 2.02, 2.14, and 2.24 for k = 3,4, and 5.

Keywords

Approximation Algorithm Cluster Center Facility Location Approximation Ratio Facility Location Problem 
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.
    Aardal, K., Chudak, F., Shmoys, D.: A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. Inf. Process. Lett. 72(5-6), 161–167 (1999)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Aardal, K., Tardos, E., Shmoys, D.: Approximation Algorithms for Facility Location Problems (Extended Abstract). In: STOC 1997, pp. 265–274 (1997)Google Scholar
  3. 3.
    Ageev, A., Ye, Y., Zhang, J.: Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. SIAM J. Discrete Math. 18(1), 207–217 (2004)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Byrka, J., Aardal, K.: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. SIAM J. Comput. 39(6), 2212–2231 (2010)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Byrka, J., Ghodsi, M., Srinivasan, A.: LP-rounding algorithms for facility-location problems CoRR, abs/1007.3611 (2010)Google Scholar
  6. 6.
    Chudak, F., Shmoys, D.: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem. SIAM J. Comput. 33(1), 1–25 (2003)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. In: SODA 1998, pp. 253–259 (1998)Google Scholar
  8. 8.
    Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithmsGoogle Scholar
  9. 9.
    Krishnaswamy, R., Sviridenko, M.: Inapproximability of the multi-level uncapacitated facility location problem. SODA 2012 31(1), 718–734 (1999); Journal of Algorithms 31(1), 228–248 (1999) Google Scholar
  10. 10.
    Li, S.: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 77–88. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  11. 11.
    Sviridenko, M.: An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 240–257. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  12. 12.
    Zhang, J.: Approximating the two-level facility location problem via a quasi-greedy approach. In: SODA 2004, pp. 808–817 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jaroslaw Byrka
    • 1
  • Bartosz Rybicki
    • 1
  1. 1.Institute of Computer ScienceUniversity of WroclawWrocławPoland

Personalised recommendations