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

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 r j facilities instead of just one. The facilities other than the closest one are “backup” facilities for that d...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of algorithms Ročník 48; číslo 2; s. 429 - 440
Hlavní autoři: Guha, Sudipto, Meyerson, Adam, Munagala, Kamesh
Médium: Journal Article
Jazyk:angličtina
Vydáno: San Diego, CA Elsevier Inc 01.09.2003
Elsevier
Témata:
Applied sciences
Approximation algorithm
Exact sciences and technology
Facility location
Fault tolerance
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Facility location
Approximation algorithm
Fault tolerance
Costs
Filtering
Program
Constant
Use
Routing
Generalization
Location problem
Weight
Numerical approximation
Assignment
Integer
Relaxation
Randomization
Type
Linear combination
Technique
Application
Link
Fault tolerant system
ISSN:0196-6774, 1090-2678
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 r j 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 r j 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.
ISSN:0196-6774
1090-2678
DOI:10.1016/S0196-6774(03)00056-7