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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of algorithms Vol. 48; no. 2; pp. 429 - 440
Main Authors:	Guha, Sudipto, Meyerson, Adam, Munagala, Kamesh
Format:	Journal Article
Language:	English
Published:	San Diego, CA Elsevier Inc 01.09.2003 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!