Robust fault tolerant uncapacitated facility location

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 5, Issue , 2010, Pages 191-202

  Chechik, Shiri ^a   Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Approximation algorithms; Facility location; Fault tolerance

Indexed keywords

FACILITY LOCATIONS; FAULT-TOLERANT; NP-HARD; POLYNOMIAL-TIME ALGORITHMS; UNCAPACITATED FACILITY LOCATIONS;

APPROXIMATION ALGORITHMS; COMPUTER SCIENCE; FAULT TOLERANCE; POLYNOMIAL APPROXIMATION;

COSTS;

EID: 84880289076     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2010.2454     Document Type: Conference Paper

References (15)

1. A. Billionnet and M. Costa, Solving the uncapacited plant location problem on trees, Discrete Applied Mathematics 49, (1994), 51-59.
2. J. Byrka, An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In Proc. 10th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2007, 29-43.
3. M. Charikar and S. Guha, Improved combinatorial algorithms for facility location problems, SIAM J. Comput. 34, (2005), 803-824.
4. F. A. Chudak and D. B. Shmoys, Improved approximation algorithms for the uncapacitated facility location problem, SIAM J. Comput. 33, (2003) 1-25.
5. K. Dhamdhere, V. Goyal, R. Ravi, and M. Singh, How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems, In Proc. 46th IEEE Symp. on Foundations of Computer Science (FOCS), 2005, 367-378.
6. U. Feige, K. Jain, M. Mahdian, and V.S. Mirrokni, Robust combinatorial optimization with exponential scenarios, In Proc. 12th Int. Conf. on Integer Programming and Combinatorial Optimization (IPCO), Ithaca, NY, 2007, 439-453.
7. S. Guha and S. Khuller, Greedy strikes back: Improved facility location algorithms, J. of Algorithms 31, (1999), 228-248.
8. Sudipto Guha, Adam Meyerson, and Kamesh Munagala, A constant factor approximation algorithm for the fault-tolerant facility location problem, J. Algorithms 48, (2003), 429-440.
9. K. Jain, M. Mahdian, and A. Saberi, A new greedy approach for facility location problems, In Proc. 34th ACM Symposium on Theory of Computing (STOC), 2002, 731-740.
10. K. Jain, V. Vazirani, An approximation algorithm for the fault tolerant metric facility location problem, In Proc. APPROX,LNCS Vol. 1913, 2000, 177-183.
11. S. Khuller, R. Pless, and Y. Sussmann, Fault tolerant k-center problems. Theoret. Comput. Sci. 242 12 (2000), 237-245
12. M. Mahdian, Y. Ye, and J. Zhang, Approximation algorithms for metric facility location problems, SIAM J. on Computing 36, (2006), 411-432.
13. D.B. Shmoys, Approximation algorithms for facility location problems, In Proc. 3rd Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), LNCS, Vol. 1913, (2000), 265-274.
14. C. Swamy, D. Shmoys, Fault-tolerant facility location, In Proc. 14th ACM-SIAM SODA, 2003, 735-736.
15. L.A. Wolsey, An analysis of the greedy algorithm for the submodular set covering problem, Combinatorica 2, (1982), 385-393.