The fault-tolerant facility allocation problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5878 LNCS, Issue , 2009, Pages 689-698

  Xu, Shihong ^a   Shen, Hong ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION PROBLEMS; APPROXIMATION FACTOR; CONNECTION-COSTS; FACILITY LOCATIONS; FAULT-TOLERANT; POLYNOMIAL-TIME ALGORITHMS; TRIANGLE INEQUALITY;

COMPUTATION THEORY; COSTS; FACILITIES; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 75649127295     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_70     Document Type: Conference Paper

References (24)

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)
2. Swamy, C., Shmoys, D.B.: Fault-tolerant facility location. ACM Trans. Algorithms 4(4), 1-27 (2008)
3. Pitu, B., Mirchandani, R.L.F. (eds.): Discrete Location Theory. John Wiley, New York (1990)
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)
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)
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)
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)
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)
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)
10. Hochbaum, D.S.: Heuristics for the fixed cost median problem. Mathematical Programming 22(1), 148-162 (1982)
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)
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)
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)
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)
15. Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location problems. SIAM J. Comput. 34(4), 803-824 (2005)
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)
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)
18. Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)
19. Mahdian, M., Ye, Y., Zhang, J.: A 1.52-approximation algorithm for the uncapac-itated facility location problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 229-242. Springer, Heidelberg (2002)
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)
21. Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the unca-pacitated facility location problem. SIAM J. Comput. 33(1), 1-25 (2004)
22. Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. Journal of Algorithms 31, 228-248 (1999)
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)
24. Xu, S., Shen, H.: Fault-tolerant k-facility allocation (manuscript)