Nirman Kumar

activity

20102021

most citedEfficient Algorithms for k-Regret Minimizing Sets

22 citations · 50 across the 8 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.CG2021

Red blue $k$ -center clustering with distance constraints

M. Eskandari, B. B. Khare, N. Kumar

We consider a variant of the $k$ -center clustering problem in $ℜ^{d}$ , where the centers can be divided into two subsets, one, the red centers of size $p$ , and the other, the blue…

cs.CG2021

Separated Red Blue Center Clustering

Marzieh Eskandari, Bhavika B. Khare, Nirman Kumar

We study a generalization of $k$ -center clustering, first introduced by Kavand et. al., where instead of one set of centers, we have two types of centers, $p$ red and $q$ blue, and…

Red blue k-center clustering with distance constraints

Separated Red Blue Center Clustering

Red blue $k$ -center clustering with distance constraints