Skip to main content

A 5-Approximation for Capacitated Facility Location

  • Conference paper
Algorithms – ESA 2012 (ESA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7501))

Included in the following conference series:

Abstract

In this paper, we propose and analyze a local search algorithm for the capacitated facility location problem. Our algorithm is a modification of the algorithm proposed by Zhang et al. [7] and improves the approximation ratio from 5.83 to 5. We achieve this by modifying the close, open and multi operations. The idea of taking linear combinations of inequalities used in Aggarwal et al.[1] is crucial in achieving this result. The example proposed by Zhang et al. also shows that our analysis is tight.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Aggarwal, A., Anand, L., Bansal, M., Garg, N., Gupta, N., Gupta, S., Jain, S.: A 3-Approximation for Facility Location with Uniform Capacities. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 149–162. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Chudak, F., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. Math. Program. 102(2), 207–222 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Korupolu, M.R., Greg Plaxton, C., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37(1), 146–188 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kuehn, A.A., Hamburger, M.J.: A heuristic program for locating warehouses. Management Science 9(4), 643–666 (1963)

    Article  Google Scholar 

  5. Mahdian, M., Pál, M.: Universal Facility Location. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 409–421. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Pál, M., Tardos, É., Wexler, T.: Facility location with nonuniform hard capacities. In: FOCS 2001: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, p. 329. IEEE Computer Society, Washington, DC (2001)

    Google Scholar 

  7. Zhang, J., Chen, B., Ye, Y.: A multiexchange local search algorithm for the capacitated facility location problem. Math. Oper. Res. 30(2), 389–403 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bansal, M., Garg, N., Gupta, N. (2012). A 5-Approximation for Capacitated Facility Location. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33090-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33089-6

  • Online ISBN: 978-3-642-33090-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics