A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
A heuristic for the p-center problem in graphs
Discrete Applied Mathematics
How to allocate network centers
Journal of Algorithms
Fault tolerant K-center problems
Theoretical Computer Science
The Capacitated K-Center Problem
SIAM Journal on Discrete Mathematics
Generalized submodular cover problems and applications
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Powers of graphs: A powerful approximation technique for bottleneck problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A simple heuristic for the p-centre problem
Operations Research Letters
Matroid and knapsack center problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Hi-index | 0.00 |
The capacitated K-center (CKC) problem calls for locating K service centers in the vertices of a given weighted graph, and assigning each vertex as a client to one of the centers, where each service center has a limited service capacity and thus may be assigned at most L clients, so as to minimize the maximum distance from a vertex to its assigned service center. This paper studies the fault tolerant version of this problem, where one or more service centers might fail simultaneously. We consider two variants of the problem. The first is the α-fault-tolerant capacitated K-Center ($\mbox{\tt $\alpha$-FT-CKC}$) problem. In this version, after the failure of some centers, all nodes are allowed to be reassigned to alternate centers. The more conservative version of this problem, hereafter referred to as the α-fault-tolerant conservative capacitated K-center ($\mbox{\tt $\alpha$-FT-CCKC}$) problem, is similar to the $\mbox{\tt $\alpha$-FT-CKC}$ problem, except that after the failure of some centers, only the nodes that were assigned to those centers before the failure are allowed to be reassigned to other centers. We present polynomial time algorithms that yields 9-approximation for the $\mbox{\tt $\alpha$-FT-CKC}$ problem and 17-approximation for the $\mbox{\tt $\alpha$-FT-CCKC}$ problem.