A heuristic for the p-center problem in graphs
Discrete Applied Mathematics
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On a generalization of the p-Center Problem
Information Processing Letters
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The p-neighbor k-center problem
Information Processing Letters
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
A 3-approximation algorithm for the k-level uncapacitated facility location problem
Information Processing Letters
Fault tolerant K-center problems
Theoretical Computer Science
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A constant factor approximation for the single sink edge installation problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Fault-tolerant facility location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
The Access Network Design Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Improved approximation algorithms for capacitated facility location problems
Mathematical Programming: Series A and B
Theoretical Computer Science - Algorithmic applications in management
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
Approximation algorithms for the Fault-Tolerant Facility Placement problem
Information Processing Letters
The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
INFORMS Journal on Computing
Unconstrained and constrained fault-tolerant resource allocation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
An improved approximation algorithm for uncapacitated facility location problem with penalties
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
An approximation algorithm for a facility location problem with inventories and stochastic demands
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Improved approximation algorithms for the robust fault-tolerant facility location problem
Information Processing Letters
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Fault-tolerant facility location: a randomized dependent LP-Rounding algorithm
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
An approximation algorithm for a facility location problem with stochastic demands and inventories
Operations Research Letters
Computers and Industrial Engineering
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
| Hi-index | 0.00 |
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) fail. Hence, for any demand point, we can assign nonincreasing weights to the routing costs to farther facilities. The cost of assignment for demand j is the weighted linear combination of the assignment costs to its rj closest open facilities. We wish to minimize the sum of the cost of opening the facilities and the assignment cost of each demand j. We obtain a factor 4 approximation to this problem through the application of various rounding techniques to the linear relaxation of an integer program formulation. We further improve the approximation ratio to 3.16 using randomization and to 2.41 using greedy local-search type techniques.