Skip to main content
SpringerLink
Log in
Book cover

Handbook of Combinatorial Optimization pp 1293–1309Cite as

Fault-Tolerant Facility Allocation

  • Reference work entry
  • First Online:

  • 7147 Accesses

Abstract

The problem of Fault-Tolerant Facility Allocation (FTFA) is a relaxation of the classical Fault-Tolerant Facility Location (FTFL) problem (Jain K, Vazirani VV (2000) An approximation algorithm for the fault tolerant metric facility location problem. In: APPROX ’00: proceedings of the third international workshop on approximation algorithms for combinatorial optimization, London, UK. Springer, pp 177–183). Given a set of sites, each containing a set of identical facilities and associated with an operating cost for each facility, a set of clients, where each client-site pair has a (distance-based) connection cost and each client has a connection requirement FTFA, requires to compute a connection scheme between clients and sites such that each client is allocated a desired number of facilities and the total combined facility (operating) cost and connection cost for all clients to access their required facilities is minimum. Compared with the FTFL problem which restricts that at most one facility can be opened at each site, the FTFA problem is less constrained and hence incurs a smaller cost. This chapter introduces our recent work on this problem (Xu S, Shen H (2009) The fault-tolerant facility allocation problem. In ISAAC, pp 689–698) and shows that the metric version of FTFA, i.e., the connection costs satisfy triangle inequality, is solvable in polynomial time within approximation ratio 1.861, which is better than the best approximation ratio 2.076 for metric FTFL (Swamy C, Shmoys DB (2008) Fault-tolerant facility location. ACM Trans Algorithms 4(4):1–27) known that time.

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   3,400.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   549.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, V. Pandit, Local search heuristic for k-median and facility location problems, in STOC ’01: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (ACM, New York, 2001), pp. 21–29

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. M. Charikar, S. Guha, Improved combinatorial algorithms for the facility location and k-median problems, in FOCS ’99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, Washington, DC, USA (IEEE Computer Society, 1999), pp. 378

    Google Scholar 

  4. M. Charikar, S. Guha, Improved combinatorial algorithms for facility location problems. SIAM J. Comput. 34(4), 803–824 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. M. Charikar, S. Guha, E. Tardos, D.B. Shmoys, A constant-factor approximation algorithm for the k-median problem, in ACM Symposium on Theory of Computing, 1999, pp. 1–10

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. F.A. Chudak, D.P. Williamson, Integer programming and combinatorial optimization, in Improved Approximation Algorithms for Capacitated Facility Location Problems. Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 1999), pp. 99–113

    Google Scholar 

  8. G. Cornuejols, M.L. Fisher, G.L. Nemhauser, Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manage. Sci. 23(8), 789–810 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  9. R.L. Francis, P.B. Mirchandani (eds.), Discrete Location Theory (Wiley, New York, 1990)

    MATH  Google Scholar 

  10. S. Guha, S. Khuller, Greedy strikes back: improved facility location algorithms. J. Algorithms 31(21), 228–248 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. S. Guha, A. Meyerson, K. Munagala, Improved algorithms for fault tolerant facility location, in SODA ’01: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA (Society for Industrial and Applied Mathematics, 2001), pp. 636–641

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. D.S. Hochbaum, Heuristics for the fixed cost median problem. Math. Program. 22(1), 148–162 (1982)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. K. Jain, V.V. Vazirani, Primal-dual approximation algorithms for metric facility location and k-median problems, in IEEE Symposium on Foundations of Computer Science (IEEE Computer Society, Los Alamitos, 1999), pp. 2–13

    Google Scholar 

  16. K. Jain, V.V. Vazirani, An approximation algorithm for the fault tolerant metric facility location problem, in APPROX ’00: Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization, London, UK (Springer, 2000), pp. 177–183

    Google Scholar 

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

  18. K. Jain, M. Mahdian, A. Saberi, A new greedy approach for facility location problems, in STOC ’02: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, New York, NY, USA (ACM, 2002), pp. 731–740

    Google Scholar 

  19. J.-H. Lin, J.S. Vitter, e-approximations with minimum packing constraint violation, in STOC ’92: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, New York, NY, USA (ACM, 1992), pp. 771–782

    Google Scholar 

  20. M. Mahdian, Y. Ye, J. Zhang, Approximation algorithms for metric facility location problems, SIAM J. Comput. 36(2), 411–432 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  21. R. McEliece, E. Rodemich, H. Rumsey, L. Welch, New upper bounds on the rate of a code via the delsarte-macwilliams inequalities. IEEE Trans. Inf. Theory 23(2), 157–166 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  22. M. Mahdian, E. Markakis, A. Saberi, V. Vazirani, A greedy facility location algorithm analyzed using dual-fitting, in Proc. of 4th International Wrokshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Berkeley, CA, USA (Springer, 2001), pp. 127–137

    Google Scholar 

  23. D.B. Shmoys, E. Tardos, K. Aardal, Approximation algorithms for facility location problems, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, Texas (ACM press), pp. 265–274

    Google Scholar 

  24. M. Sviridenko, An improved approximation algorithm for the metric uncapacitated facility location problem, in Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization, London, UK (Springer, 2002), pp. 240–257

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  26. V.V. Vazirani, Approximation Algorithms (Springer, Berlin, 2001)

    Google Scholar 

  27. S. Xu, H. Shen, The Fault-Tolerant Facility Allocation Problem, in Proc. of 20th International Symposium, Honolulu, Hawaii, USA (Springer, 2009), pp. 689–698

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, The University of Adelaide, 5005, Adelaide, SA, Australia

    Hong Shen & Shihong Xu

  2. School of Information Science and Technology, Sun Yat-sen University, Guangzhou, People’s Republic of China

    Hong Shen

Authors
  1. Hong Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shihong Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Hong Shen or Shihong Xu .

Editor information

Editors and Affiliations

  1. Department of Industrial and Systems Eng, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  2. Department of Computer Science, University of Texas, Dallas, Richardson, Texas, USA

    Ding-Zhu Du

  3. Dept. Comp. Sci. & Engineering, University of California, San Diego, La Jolla, California, USA

    Ronald L. Graham

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this entry

Cite this entry

Shen, H., Xu, S. (2013). Fault-Tolerant Facility Allocation. In: Pardalos, P., Du, DZ., Graham, R. (eds) Handbook of Combinatorial Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7997-1_11

Download citation

Publish with us

Policies and ethics

Search

Navigation