Skip to main content
Springer Nature Link
Log in

Improved Approximation Algorithms for Metric Facility Location Problems

  • Conference paper
  • First Online:
Approximation Algorithms for Combinatorial Optimization (APPROX 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2462))

  • 1109 Accesses

Abstract

In this paper we present a 1.52-approximation algorithm for the uncapacitated metric facility location problem. This algorithm uses an idea of cost scaling, a greedy algorithm of Jain, Mahdian and Saberi, and a greedy augmentation procedure of Charikar, Guha and Khuller. We also present a 2.89-approximation for the capacitated metric facility location problem with soft capacities.

Research supported in part by NSF grants DMI-9908077.

Research supported in part by NSF grants DMI-9908077 through Yinyu Ye.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M. Charikar and S. Guha. Improved Combinatorial algorithms for facility location and k-median problems. In Proceeding of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 378–388, 1999.

    Google Scholar 

  2. F.A. Chudak, Improved approximation algorithms for uncapacitated facility location. In R.E. Bixby, E.A. Boyd, and R.Z. Ríos-Mercado, editors, Integer Programming and Combinatorial Optimization, volume 1412 of Lecture Notes in Computer Science, pages 180–194. Springer, Berlin, 1998.

    Chapter  Google Scholar 

  3. F.A. Chudak and D.B. Shmoys. Improved approximation algorithms for the capacitated facility location problem. In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 875–876, 1999.

    Google Scholar 

  4. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31:228–248, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  5. D.S. Hochbaum. Heuristics for the fixed cost median problem. Mathematical Programming, 22(2):148–162, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  6. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems, In Proceedings of STOC 2002.

    Google Scholar 

  7. K. Jain and V.V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation Journal of the ACM, 48:274–296, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  8. M.R. Korupolu, C.G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1–10, 1998.

    Google Scholar 

  9. M. Mahdian, E. Markakis, A. Saberi, and V.V. Vazirani. A Greedy Facility Location Algorithm Analyzed using Dual Fitting. In Proceedings of 5th International Workshop on Randomization and Approximation Techniques in Computer Science, Volume 2129 of Lecture Notes in Compuer Science, page 127–137. Springer-Verlag, 2001.

    Google Scholar 

  10. D.B. Shmoys. Approximation algorithms for facility location problems. In K. Jansen and S. Khuller, editors, Approximation Algorithms for Combinatorial Optimization, volume 1913 of Lecture Notes in Computer Science, pages 27–33. Springer, Berlin, 2000.

    Chapter  Google Scholar 

  11. D.B. Shmoys, E. Tardos, and K.I. Aardal. Approximation algorithms for facility location problems. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 265–274, 1997.

    Google Scholar 

  12. M. Sviridenko. An improved approximation algorithm for the metric uncapacitated facility location problem. In W.J. Cook and A.S. Schulz, editors, Integer Programming and Combinatorial Optimization, volume 2337 of Lecture Notes in Computer Science, pages 240–257. Springer, Berlin, 2002.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, MIT, 02139, Cambridge, MA, USA

    Mohammad Mahdian

  2. Department of Management Science and Engineering, Stanford University, 94305-4026, Stanford, CA, USA

    Yinyu Ye

  3. Department of Management Sciences, University of Iowa, 52242, Iowa City, IA, USA

    Jiawei Zhang

Authors
  1. Mohammad Mahdian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yinyu Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiawei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik und praktische Mathematik, Universität Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

  2. Dipartimento di Informatika e Sistemistica, Universita di Roma La Sapienza, Via Salaria 113, 00198, Roma, Italy

    Stefano Leonardi

  3. College of Computing, Georgia Institute of Technology, 801 Atlantic Drive, Atlanta, 30332-0280, Georgia, USA

    Vijay Vazirani

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mahdian, M., Ye, Y., Zhang, J. (2002). Improved Approximation Algorithms for Metric Facility Location Problems. In: Jansen, K., Leonardi, S., Vazirani, V. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2002. Lecture Notes in Computer Science, vol 2462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45753-4_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-45753-4_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44186-1

  • Online ISBN: 978-3-540-45753-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation