A constant factor approximation algorithm for the fault-tolerant facility location problem

Journal Article (Journal Article)

We consider a generalization of the classical facility location problem, where we require the solution to be fault-tolerant. In this generalization, every demand point j must be served by rj facilities instead of just one. The facilities other than the closest one are "backup" facilities for that demand, and any such facility will be used only if all closer facilities (or the links to them) fail. Hence, for any demand point, we can assign nonincreasing weights to the routing costs to farther facilities. The cost of assignment for demand j is the weighted linear combination of the assignment costs to its rj closest open facilities. We wish to minimize the sum of the cost of opening the facilities and the assignment cost of each demand j. We obtain a factor 4 approximation to this problem through the application of various rounding techniques to the linear relaxation of an integer program formulation. We further improve the approximation ratio to 3.16 using randomization and to 2.41 using greedy local-search type techniques. © 2003 Elsevier Inc. All rights reserved.

Full Text

Duke Authors

Cited Authors

  • Guha, S; Meyerson, A; Munagala, K

Published Date

  • January 1, 2003

Published In

Volume / Issue

  • 48 / 2

Start / End Page

  • 429 - 440

International Standard Serial Number (ISSN)

  • 0196-6774

Digital Object Identifier (DOI)

  • 10.1016/S0196-6774(03)00056-7

Citation Source

  • Scopus