An approximation algorithm for the fault tolerant metric facility location problem

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

Volumn 1913, Issue , 2000, Pages 177-182

  Jain, Kamal ^a   Vazirani, Vijay V ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; FAULT TOLERANCE; LOCATION;

FACILITY LOCATION PROBLEM; FAULT-TOLERANT; HARMONIC NUMBER; NON-TRIVIAL; PRIMAL DUAL ALGORITHMS; STEINER NETWORK;

APPROXIMATION ALGORITHMS;

EID: 84937402094     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44436-x_18     Document Type: Conference Paper

References (5)

1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM J. on Computing, 24:440-456, 1995.
2. M. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, and D. Williamson. Improved approximation algorithms for network design problems. Proc. 5th ACMSIAM Symp. on Discrete Algorithms, 223-232, 1994.
3. M. X. Goemans, D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal of Computing, 24:296-317, 1995.
4. K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. To appear in JACM.
5. D. P. Williamson, M. X. Goemans, M. Mihail, and V. V. Vazirani. A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica, 15:435-454, December 1995.