11 citations · 49 across the 23 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 7 cited
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…
cs.CG2013★ 11 cited
Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small
Alina Ene, Sariel Har-Peled, Benjamin Raichel
We study the \LowerBoundedCenter (\lbc) problem, which is a clustering problem that can be viewed as a variant of the \kCenter problem. In the \lbc problem, we are given a set of p…