TY - GEN

T1 - The fault tolerant capacitated k-center problem

AU - Chechik, Shiri

AU - Peleg, David

PY - 2012

Y1 - 2012

N2 - 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 (α-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 (α-FT-CCKC) problem, is similar to the α-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 α-FT-CKC problem and 17-approximation for the α-FT-CCKC problem.

AB - 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 (α-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 (α-FT-CCKC) problem, is similar to the α-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 α-FT-CKC problem and 17-approximation for the α-FT-CCKC problem.

UR - http://www.scopus.com/inward/record.url?scp=84864051806&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-31104-8_2

DO - 10.1007/978-3-642-31104-8_2

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84864051806

SN - 9783642311031

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 13

EP - 24

BT - Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Proceedings

T2 - 19th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2012

Y2 - 30 June 2012 through 2 July 2012

ER -