Approximation Algorithms for Fault Tolerant Facility Allocation
نویسندگان
چکیده
منابع مشابه
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...
متن کاملLP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem
The Fault-Tolerant Facility Placement problem (FTFP) is a generalization of the classic Uncapacitated Facility Location Problem (UFL). In FTFP we are given a set of facility sites and a set of clients. Opening a facility at site i costs fi and connecting client j to a facility at site i costs dij. We assume that the connection costs (distances) dij satisfy the triangle inequality. Multiple faci...
متن کاملOn Fault-Tolerant Facility Location
We give a new LP-rounding 1.724-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithm of Shmoys & Swamy. Our work applies a dependent-rounding technique in the domain of facility location. The analysis of our algorithm benefits from, and extends, methods developed for Uncapacitated ...
متن کاملConstrained Fault-Tolerant Resource Allocation
We follow [18,25] and give a series of improved results for the Constrained Fault-Tolerant Resource Allocation (FTRA) problem. In FTRA, we are given a set of sites containing facilities as resources, and a set of clients consuming these resources. Specifically, each site i is allowed to open at most Ri facilities with cost fi for each opened facility. Each client j requires an allocation of rj ...
متن کاملProcess Allocation in Fault - Tolerant
Process allocation is important for fault-tolerant multi-computer systems since it directly aaects the performance and dependability of the system. In this paper, we consider load-balancing process allocation for fault-tolerant systems that balances the load before as well as after faults start to degrade the performance of the system. We show two schemes to tolerate multiple faults in the pass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2013
ISSN: 0895-4801,1095-7146
DOI: 10.1137/090781048