22 citations · 50 across the 8 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★ 1 cited
Approximating Minimization Diagrams and Generalized Proximity Search
Sariel Har-Peled, Nirman Kumar
We investigate the classes of functions whose minimization diagrams can be approximated efficiently in \Re^d. We present a general framework and a data-structure that can be used t…