Fault Tolerant Clustering Revisited

Nirman Kumar, Benjamin Raichel

In discrete k-center and k-median clustering, we are given a set of points P in a metric space M, and the task is to output a set C \subseteq ? P, |C| = k, such that the cost of cl…