The fault-tolerant capacitated K-center problem

Shiri Chechik*, David Peleg

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

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-CKC) 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 yield 9-approximation for the α-FT-CKC problem and 17-approximation for the α-FT-CKC problem.

Original languageEnglish
Pages (from-to)12-25
Number of pages14
JournalTheoretical Computer Science
Volume566
Issue numberC
DOIs
StatePublished - 2015

Keywords

  • Approximation algorithms
  • Fault-tolerance
  • K-center

Fingerprint

Dive into the research topics of 'The fault-tolerant capacitated K-center problem'. Together they form a unique fingerprint.

Cite this