Approximation algorithms for the Fault-Tolerant Facility Placement problem

Authors:
Li Yan;Marek Chrobak
Affiliations:
Department of Computer Science, University of California, Riverside, CA 92521, USA;Department of Computer Science, University of California, Riverside, CA 92521, USA
Venue:
Information Processing Letters
Year:
2011

Citing 16
Cited 4

Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms

Journal of Algorithms
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Approximation algorithms

Approximation algorithms
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP

Journal of the ACM (JACM)
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

SIAM Journal on Computing
Local Search Heuristics for k-Median and Facility Location Problems

SIAM Journal on Computing
A constant factor approximation algorithm for the fault-tolerant facility location problem

Journal of Algorithms
Improved Combinatorial Algorithms for Facility Location Problems

SIAM Journal on Computing
Approximation Algorithms for Metric Facility Location Problems

SIAM Journal on Computing
Fault-tolerant facility location

ACM Transactions on Algorithms (TALG)
The Fault-Tolerant Facility Allocation Problem

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

SIAM Journal on Computing
Fault-tolerant facility location: a randomized dependent LP-Rounding algorithm

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

Unconstrained and constrained fault-tolerant resource allocation

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Approximating the reliable resource allocation problem using inverse dual fitting

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Improved approximation algorithms for constrained fault-tolerant resource allocation

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
An Efficient Approach for Solving Reliable Facility Location Models

INFORMS Journal on Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

In the Fault-Tolerant Facility Placement problem (FTFP) we are given a set of customers C, a set of sites F, and distances between customers and sites. We assume that the distances satisfy the triangle inequality. Each customer j has a demand r"j and each site may open an unbounded number of facilities. The objective is to minimize the total cost of opening facilities and connecting each customer j to r"j different open facilities. We present two LP-rounding algorithms for FTFP. The first algorithm achieves an approximation ratio of 4. The second algorithm uses the method of filtering to improve the ratio to 3.16.