
NearOptimal Clustering in the kmachine model
The clustering problem, in its many variants, has numerous applications ...
read it

Approximating Dominating Set on Intersection Graphs of Lframes
We consider the Dominating Set (DS) problem on the intersection graphs o...
read it

Approximating Dominating Set on Intersection Graphs of Rectangles and Lframes
We consider the Minimum Dominating Set (MDS) problem on the intersection...
read it

Constrained Orthogonal Segment Stabbing
Let S and D each be a set of orthogonal line segments in the plane. A li...
read it

A Constant Approximation for Colorful kCenter
In this paper, we consider the colorful kcenter problem, which is a gen...
read it

Geometric Planar Networks on Bichromatic Points
We study four classical graph problems – Hamiltonian path, Traveling sal...
read it

Improved Bounds for Metric Capacitated Covering Problems
In the Metric Capacitated Covering (MCC) problem, given a set of balls ℬ...
read it

On Perturbation Resilience of NonUniform kCenter
The NonUniform kcenter (NUkC) problem has recently been formulated by ...
read it
Sayan Bandyapadhyay
is this you? claim profile