Skip to main content
SpringerLink
Log in

LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem

(Extended Abstract)

  • Conference paper
Algorithms and Complexity (CIAC 2013)

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

Included in the following conference series:

Abstract

The Fault-Tolerant Facility Placement problem (FTFP) is a generalization of the Uncapacitated Facility Location Problem (UFL). In FTFP we are given a set of facility sites and a set of clients. Opening a facility at site i costs f i and connecting client j to a facility at site i costs d ij , where the costs d ij satisfy the triangle inequality. Multiple facilities can be opened at any site. Each client j has a demand r j , which means that it needs to be connected to r j different facilities. The goal is to minimize the sum of facility opening cost and connection cost. The main result of this paper is a 1.575-approximation algorithm for FTFP, based on LP-rounding.

Research supported by NSF Grant CCF-1217314. Full version available in [20].

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

Access this chapter

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 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. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3), 544–562 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Byrka, J., Aardal, K.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. Comput. 39(6), 2212–2231 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Byrka, J., Ghodsi, M.R., Srinivasan, A.: LP-rounding algorithms for facility-location problems. CoRR abs/1007.3611(2010)

    Google Scholar 

  4. Byrka, J., Srinivasan, A., Swamy, C.: Fault-tolerant facility location: A randomized dependent LP-rounding algorithm. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 244–257. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Chudak, F., Shmoys, D.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33(1), 1–25 (2004)

    Article  MathSciNet  Google Scholar 

  6. Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. In: Proc. 9th SODA, pp. 649–657 (1998)

    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. Gupta, A.: Lecture notes: CMU 15-854b (Spring 2008)

    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. Jain, K., Vazirani, 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 

  11. Jain, K., Vazirani, V.: An approximation algorithm for the fault tolerant metric facility location problem. Algorithmica 38(3), 433–439 (2003)

    Article  MathSciNet  Google Scholar 

  12. 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)

    Chapter  Google Scholar 

  13. Liao, K., Shen, H.: Unconstrained and constrained fault-tolerant resource allocation. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol. 6842, pp. 555–566. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Shmoys, D., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Proc. 29th STOC, pp. 265–274 (1997)

    Google Scholar 

  15. Sviridenko, M.I.: 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)

    Chapter  Google Scholar 

  16. Swamy, C., Shmoys, D.: Fault-tolerant facility location. ACM Trans. Algorithms 4(4), 1–27 (2008)

    Article  MathSciNet  Google Scholar 

  17. Vygen, J.: Approximation Algorithms for Facility Location Problems. Forschungsinst. für Diskrete Mathematik (2005)

    Google Scholar 

  18. Xu, S., Shen, H.: The fault-tolerant facility allocation problem. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 689–698. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Yan, L., Chrobak, M.: Approximation algorithms for the fault-tolerant facility placement problem. Inf. Process. Lett. 111(11), 545–549 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  20. Yan, L., Chrobak, M.: LP-rounding Algorithms for the Fault-Tolerant Facility Placement Problem. CoRR abs/1205.1281 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California at Riverside, USA

    Li Yan & Marek Chrobak

Authors
  1. Li Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marek Chrobak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, Department of Computer Engineering and Informatics, University of Patras, 265 00, Patras, Greece

    Paul G. Spirakis

  2. LSI Department, Edif Omega, Universitat Politècnica de Catalunya, Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    Maria Serna

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yan, L., Chrobak, M. (2013). LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem. In: Spirakis, P.G., Serna, M. (eds) Algorithms and Complexity. CIAC 2013. Lecture Notes in Computer Science, vol 7878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38233-8_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38233-8_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38232-1

  • Online ISBN: 978-3-642-38233-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation