Given a set of n colored points with k colors in the plane, we study the...
We consider the well-studied Robust (k, z)-Clustering problem, which
gen...
This paper considers the well-studied algorithmic regime of designing a
...
We give a constant factor polynomial time pseudo-approximation algorithm...
Given a graph G=(V,E), the dominating set problem asks for a minimum sub...