Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2005: Computing and Combinatorics pp 644–653Cite as

An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with Penalties

  • Conference paper

  • 1804 Accesses

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

Abstract

In this paper, we consider an interesting variant of the facility location problem called uncapacitated facility location problem with penalties (UFLWP for short) in which each client is either assigned to an opened facility or rejected by paying a penalty. We present a 1.8526-approximation algorithm for the UFLWP problem. Our algorithm first enhances the primal-dual method for the UFLWP problem [3] so that outliers can be recognized more efficiently, and then applies a local search heuristic to further reduce the cost for serving those non-rejected clients.

This research was supported in part by an IBM faculty partnership award, and an IRCAF award from SUNY Buffalo.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arya, V., Garg, N., Meyerson, A., Munagala, K., Pandit, V.: Local Search Heuristics for k-median and Facility Location Problems. In: Proc. 33rd ACM Symposium on Theory of Computing, pp. 21–29 (2001)

    Google Scholar 

  2. Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location and k-median problems. In: Proc. 39th IEEE Symposium on Foundations of Computer Science, pp. 378–388 (1999)

    Google Scholar 

  3. Charikar, M., Khuller, S., Mount, D., Narasimhan, G.: Algorithms for Facility Location Problems with Outliers. In: Proc. Symposium on Discrete Algorithms, pp. 642–651 (2001)

    Google Scholar 

  4. Chudak, F., Shmoys, D.: Improved approximation algorithms for a capacitated facility location problem. In: Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 875–876 (1999)

    Google Scholar 

  5. Chudak, F.A., Williamson, D.P.: Improved Approximation Algorithms for Capacitated Facility Location Problems. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 99–113. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. J. Algorithms 31(1), 228–248 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Guha, S., Meyerson, A., Munagala, K.: A constant factor approximation algorithm for the fault-tolerant facility location problem. J. Algorithms 48(2), 429–440 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jain, K., Vazirzni, V.: Approximation Algorithms for Metric Facility Location and k-Median Problems Using the Primal-Dual Schema and Lagrangian Relaxation. J. ACM 48(2), 274–296 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6), 795–824 (2003)

    Article  MathSciNet  Google Scholar 

  10. Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1–10 (1998)

    Google Scholar 

  11. Lin, J.H., Vitter, J.S.: ε-approximation with minimum packing constraint violation. In: Proceddings of the 24th Annual ACM Symposium on Theory of Computing, pp. 771–782 (1992)

    Google Scholar 

  12. Shmoys, D.B.: Approximation algorithms for facility location problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 27–33. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Shmoys, D.B., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems. In: Proc. 29th ACM Symposium on Theory of Computing, pp. 265–274 (1997)

    Google Scholar 

  14. Xu, G., Xu, J.: An LP Rounding Algorithm for Approximating Uncapacitated Facility Location Problem with Penalties. Inform. Proc. Lett. 94(3), 119–123 (2005)

    Article  MATH  Google Scholar 

  15. Zhang, J.: Approximating the two-level facility location problem via a quasi-greedy approach. In: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 808–817 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Stete University of New York at Buffalo, Buffalo, New York, 14260, USA

    Guang Xu & Jinhui Xu

Authors
  1. Guang Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinhui Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, G., Xu, J. (2005). An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with Penalties. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_65

Download citation

  • DOI: https://doi.org/10.1007/11533719_65

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28061-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation