22 citations · 50 across the 8 of their papers we have counts for
7 papers · 1 filter
Red blue -center clustering with distance constraints
M. Eskandari, B. B. Khare, N. Kumar
We consider a variant of the -center clustering problem in , where the centers can be divided into two subsets, one, the red centers of size , and the other, the blue…
Separated Red Blue Center Clustering
Marzieh Eskandari, Bhavika B. Khare, Nirman Kumar
We study a generalization of -center clustering, first introduced by Kavand et. al., where instead of one set of centers, we have two types of centers, red and blue, and…
Space Exploration via Proximity Search
Sariel Har-Peled, Nirman Kumar, David M. Mount +1
We investigate what computational tasks can be performed on a point set in , if we are only given black-box access to it via nearest-neighbor search. This is a reasonable as…
Robust Proximity Search for Balls using Sublinear Space
Sariel Har-Peled, Nirman Kumar
Given a set of n disjoint balls b1, . . ., bn in IRd, we provide a data structure, of near linear size, that can answer (1 \pm ε)-approximate kth-nearest neighbor queries in O(log…
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…
Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space
Sariel Har-Peled, Nirman Kumar
For a set of points in , and parameters and $\eps$, we present a data structure that answers $(1+\eps,k)$-\ANN queries in logarithmic time. Surprisingly, the space u…