e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
Improved algorithms for fault tolerant facility location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
An approximation algorithm for the fault tolerant metric facility location problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization 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
Improved approximation algorithms for capacitated facility location problems
Mathematical Programming: Series A and B
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)
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The Fault-Tolerant Facility Allocation Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximation algorithms for the Fault-Tolerant Facility Placement problem
Information Processing Letters
A 1.488 approximation algorithm for the uncapacitated facility location problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Unconstrained and constrained fault-tolerant resource allocation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Fast Fault-Tolerant Resource Allocation
PDCAT '11 Proceedings of the 2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies
Fault-tolerant facility location: a randomized dependent LP-Rounding algorithm
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
We initiate the study of the Reliable Resource Allocation (RRA) problem. In this problem, we are given a set of sites equipped with an unbounded number of facilities as resources. Each facility has an opening cost and an estimated reliability. There is also a set of clients to be allocated to facilities with corresponding connection costs. Each client has a reliability requirement (RR) for accessing resources. The objective is to open a subset of facilities from sites to satisfy all clients' RRs at a minimum total cost. The Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem studied in (Liao & Shen 2011) is a special case of RRA. In this paper, we present two equivalent primal-dual algorithms for the RRA problem, where the second one is an acceleration of the first and runs in quasi-linear time. If all clients have the same RR above the threshold that a single facility can provide, our analysis of the algorithm yields an approximation factor of 2+2√2 and later a reduced ratio of 3.722 using a factor revealing program. The analysis further elaborates and generalizes the generic inverse dual fitting technique introduced in (Xu & Shen 2009). As a by-product, we also formalize this technique for the classical minimum set cover problem.