Sandip Banerjee

activity

20132023

most citedParameterized Approximation for Robust Clustering in Discrete Geometric Spaces

1 citations · 1 across the 6 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

cs.CG2023

Maximum-Width Rainbow-Bisecting Empty Annulus

Sang Won Bae, Sandip Banerjee, Arpita Baral +2

Given a set of $n$ colored points with $k$ colors in the plane, we study the problem of computing a maximum-width rainbow-bisecting empty annulus (of objects specifically axis-para…

cs.DS2023★ 1 cited

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces

Fateme Abbasi, Sandip Banerjee, Jarosław Byrka +6

We consider the well-studied Robust $(k, z)$ -Clustering problem, which generalizes the classic $k$ -Median, $k$ -Means, and $k$ -Center problems. Given a constant $z \geq 1$ , the input…

cs.DS2023

Parameterized Approximation Schemes for Clustering with General Norm Objectives

Fateme Abbasi, Sandip Banerjee, Jarosław Byrka +6

This paper considers the well-studied algorithmic regime of designing a $(1 + ε)$ -approximation algorithm for a $k$ -clustering problem that runs in time $f (k, ε) p o l y (n)$ (sometimes ca…