Fault-tolerant facility location: A randomized dependent LP-rounding algorithm

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

Volumn 6080 LNCS, Issue , 2010, Pages 244-257

  Byrka, Jaroslaw ^a   Srinivasan, Aravind ^b   Swamy, Chaitanya ^c  

^a EPFL   (Switzerland)

^b Institute of Advanced Computer Science   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; DISJOINT CLUSTERS; FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; FAULT-TOLERANT; HIERARCHICAL CLUSTERING SCHEMES; LP-ROUNDING; ROUNDING PROCEDURES;

CLUSTERING ALGORITHMS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; SITE SELECTION;

APPROXIMATION ALGORITHMS;

EID: 77954417783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13036-6_19     Document Type: Conference Paper

References (11)

1. Ageev, A., Sviridenko, M.: Pipage rounding: a new method of constructing algorithms with proven performance guarantee. Journal of Combinatorial Optimization 8(3), 307-328 (2004)
2. Byrka, J.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In: APPROX-RANDOM, pp. 29-43 (2007)
3. Byrka, J., Srinivasan, A., Swamy, C.: Fault-tolerant facility location: a randomized dependent LP-rounding algorithm. arXiv:1003.1295v1
4. Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33(1), 1-25 (2003)
5. Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. J. Algorithms 31(1), 228-248 (1999) (Pubitemid 129609603)
6. 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)
7. Jain, K., Vazirani, V.V.: An approximation algorithm for the fault tolerant metric facility location problem. Algorithmica 38(3), 433-439 (2003)
8. Lin, J.-H., Vitter, J.S.: Epsilon-approximations with minimum packing constraint violation (extended abstract). In: STOC, pp. 771-782 (1992)
9. Shmoys, D.B., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: STOC, pp. 265-274 (1997)
10. Srinivasan, A.: Distributions on level-sets with applications to approximation algorithms. In: FOCS, pp. 588-597 (2001)
11. Swamy, C., Shmoys, D.B.: Fault-tolerant facility location. ACM Transactions on Algorithms 4(4) (2008)