Advertisement

Abstract

In this paper a general k-level uncapacitated facility location problem(k-GLUFLP) is proposed. It is shown that the 2-level uncapacitated facility location problem with no fixed cost(2-GLUFLNP) is strong NP-complete and a heuristic algorithm with worst case ratio of 3/2 is given for 2-GLUFLNP when the service costs are assumed to be in the metric space. We also present a randomized 3-approximation algorithm for the k-GLUFLP, when k is a fixed integer.

Keywords

Approximation algorithm Facility location Complexity k-level 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aardal, K., Chudak, F.A., Shmoys, D.B.: A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. Inform. Process. Lett. 72, 161–167 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Chudak, F.A., Shmoys, D.B.: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem. SIAM J. Comput. 33, 1–25 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Garey, M.R., Johnson, D.S. (eds.): Computers and Intractability- A guide to the Theory of NP-Completeness. W.H. Freeman & Company, San Francisco (1979)zbMATHGoogle Scholar
  4. 4.
    Guha, S., Khuller, S.: Greedy Strikes Back: Improved Facility Location Algorithms. J. Algorithm 31, 228–248 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Jain, K., Mahdian, M., Saberi, A.: A New Greedy Approach for Facility Location Problem. In: Reif, J. (ed.) Proceedings of the 34th ACM Symposium on Theory of Computing (STOC), Association for Computing Machinery, pp. 731–740 (2002)Google Scholar
  6. 6.
    Jain, K., Vazirani, V.V.: Primal-dual Approximation Algorithms for Metric Facility Location and k-median Problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 2–13 (1999) Google Scholar
  7. 7.
    Mahdian, M., Ye, Y., Zhang, J.W.: Improved Approximation Algorithms for Metric Facility Location Problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 229–242. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Shmoys, D.B., Tardos, E., Aardal, K.I.: Approximation Algorithms for Facility Location Problems. In: Tom Leighton, F., Shor, P. (eds.) Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265–274. ACM, New York (1997)Google Scholar
  9. 9.
    Zhang, J.W.: Approximating the Two-level Facility Location Problem Via a Quasi-greedy Approach. Mathematical Programming 108, 159–176 (2006)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Rongheng Li
    • 1
  • Huei-Chuen Huang
    • 2
  1. 1.Dept of MathematicsHunan Normal UniversityChangshaP.R. China
  2. 2.Dept of Industrial and Systems EngineeringNational University of SingaporeSingapore

Personalised recommendations