Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem

  • 144 Accesses

  • 17 Citations

Abstract

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 [2] for the generalized Steiner network problem. It runs in phases, and each phase, using a generalization of the primal–dual algorithm of [5] 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.

Author information

Correspondence to Kamal Jain or Vijay V. Vazirani.

Rights and permissions

Reprints and Permissions

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

Download citation

  • Approximation algorithms
  • Facility location
  • Fault tolerance
  • Linear programming