We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to r j facilities. We give the first non-trivial approximation algorithm for this problem, having an approximation guarantee of 3 · H k , where k is the maximum requirement and H k is the kth harmonic number. Our algorithm is along the lines of  for the generalized Steiner network problem. It runs in phases, and each phase, using a generalization of the primal–dual algorithm of  for the metric facility location problem, reduces the maximum residual requirement by one.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
About this article
Cite this article
Jain, K., Vazirani, V. An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem. Algorithmica 38, 433–439 (2004). https://doi.org/10.1007/s00453-003-1070-1
- Approximation algorithms
- Facility location
- Fault tolerance
- Linear programming