Fault-Tolerant Center Problems with Robustness and Fairness

by   Shichuan Deng, et al.

We study a family of clustering problems that require fault-tolerant solutions that are also robust with the presence of outliers. We consider robust fault-tolerant k-center, matroid center and knapsack center, and develop pure or multi-criteria approximation algorithms for them. In order to address the fairness concern, we also consider variants of the aforementioned problems, namely fair robust fault-tolerant center problems. In these problems, each client j has a value e_j, and we need to stochastically open a set of facilities such that the expected number of facilities that are assigned to j is at least e_j. We develop a pure approximation for fair robust fault-tolerant k-center and multi-criteria approximation algorithms for the knapsack and matroid variations.


page 1

page 2

page 3

page 4


Tight FPT Approximation for Constrained k-Center and k-Supplier

In this work, we study a range of constrained versions of the k-supplier...

l0-norm Based Centers Selection for Failure Tolerant RBF Networks

The aim of this paper is to select the RBF neural network centers under ...

Constant approximation for fault-tolerant median problems via iterative rounding

In this paper, we study the fault-tolerant matroid median and fault-tole...

Ordered k-Median with Fault-Tolerance and Robustness

We study fault-tolerant ordered k-median and robust ordered k-median, bo...

On Fault Tolerant Feedback Vertex Set

The study of fault-tolerant data structures for various network design p...

A Technique for Obtaining True Approximations for k-Center with Covering Constraints

There has been a recent surge of interest in incorporating fairness aspe...

A Fault Tolerant Mechanism for Partitioning and Offloading Framework in Pervasive Environments

Application partitioning and code offloading are being researched extens...