Skip to main content
SpringerLink
Log in

The Fault-Tolerant Facility Allocation Problem

  • Conference paper
Algorithms and Computation (ISAAC 2009)

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

Included in the following conference series:

Abstract

We study the problem of Fault-Tolerant Facility Allocation (FTFA) which is a relaxation of the classical Fault-Tolerant Facility Location (FTFL) problem [1]. Given a set of sites, a set of cities, and corresponding facility operating cost at each site as well as connection cost for each site-city pair, FTFA requires to allocate each site a proper number of facilities and further each city a prespecified number of facilities to access. The objective is to find such an allocation that minimizes the total combined cost for facility operating and service accessing. In comparison with the FTFL problem which restricts each site to at most one facility, the FTFA problem is less constrained and therefore incurs less cost which is desirable in application. In this paper, we consider the metric FTFA problem where the given connection costs satisfy triangle inequality and we present a polynomial-time algorithm with approximation factor 1.861 which is better than the best known approximation factor 2.076 for the metric FTFL problem [2].

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Jain, K., Vazirani, V.V.: An approximation algorithm for the fault tolerant metric facility location problem. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 177–182. Springer, Heidelberg (2000)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Pitu, B., Mirchandani, R.L.F. (eds.): Discrete Location Theory. John Wiley, New York (1990)

    MATH  Google Scholar 

  4. Guha, S., Meyerson, A., Munagala, K.: Improved algorithms for fault tolerant facility location. In: SODA 2001: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, pp. 636–641 (2001)

    Google Scholar 

  5. 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  MATH  MathSciNet  Google Scholar 

  6. Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.: A greedy facility location algorithm analyzed using dual fitting. In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, pp. 127–137 (2001)

    Google Scholar 

  7. Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: STOC 2002: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 731–740. ACM, New York (2002)

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  12. Lin, J.H., Vitter, J.S.: e-approximations with minimum packing constraint violation. In: STOC 1992: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pp. 771–782. ACM, New York (1992)

    Chapter  Google Scholar 

  13. Chudak, F.A.: Improved approximation algorithms for uncapacitated facility location. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 180–194. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Sviridenko, M.: 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, pp. 240–257. Springer, Heidelberg (2002)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  18. Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)

    Google Scholar 

  19. Mahdian, M., Ye, Y., Zhang, J.: A 1.52-approximation algorithm for the uncapacitated facility location problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 229–242. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Byrka, J.: An optimal bifactor approximation algorithm for the metric uncapacited facility location problem. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 29–43. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  24. Xu, S., Shen, H.: Fault-tolerant k-facility allocation (manuscript)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Shihong Xu & Hong Shen

Authors
  1. Shihong Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hong Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical and Computer Engineering, University of Hawaii, Holmes Hall 483, 2540 Dole Street, 96822, Honolulu, HI, USA

    Yingfei Dong

  2. Department of Computer Science, University of Texas at Dallas, 75083, Dallas, TX, USA

    Ding-Zhu Du

  3. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, S., Shen, H. (2009). The Fault-Tolerant Facility Allocation Problem. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10631-6_70

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10630-9

  • Online ISBN: 978-3-642-10631-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation