An Approximation Algorithm for the Stochastic Fault-Tolerant Facility Location Problem
نویسندگان
چکیده
منابع مشابه
An Approximation Algorithm For The Stochastic Fault-tolerant Facility Location Problem
In this paper, we study a stochastic version of the fault-tolerant facility location problem. By exploiting the stochastic structure, we propose a 5-approximation algorithm which uses the LProunding technique based on the revised optimal solution to the linear programming relaxation of the stochastic fault-tolerant facility location problem.
متن کامل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 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) fai...
متن کاملAn 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem
The uncapacitated facility location problem in the following formulation is considered: max S⊆I Z(S) = ∑
متن کاملImproved Approximation Algorithm for Fault-Tolerant Facility Placement
We consider the Fault-Tolerant Facility Placement problem (FTFP ), which is a generalization of the classical Uncapacitated Facility Location problem (UFL). In the FTFP problem we have a set of clients C and a set of facilities F . Each facility i ∈ F can be opened many times. For each opening of facility i we pay fi ≥ 0. Our goal is to connect each client j ∈ C with rj ≥ 1 open facilities in a...
متن کاملThe Fault-Tolerant Facility Location Problem with Submodular Penalties
In this paper, we consider the fault-tolerant facility location problem with submodular penalties that is a common generalization of the fault-tolerant facility location problem and the facility location problem with submodular penalties. For this problem, we present a combinatorial 3 ·HR-approximation algorithm, where R is the maximum connectivity requirement and HR is the R-th harmonic number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of China
سال: 2013
ISSN: 2194-668X,2194-6698
DOI: 10.1007/s40305-013-0034-7