research
∙
05/16/2023
Maximum-Width Rainbow-Bisecting Empty Annulus
Given a set of n colored points with k colors in the plane, we study the...
share
research
∙
05/12/2023
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
We consider the well-studied Robust (k, z)-Clustering problem, which gen...
research
∙
04/06/2023
Parameterized Approximation Schemes for Clustering with General Norm Objectives
This paper considers the well-studied algorithmic regime of designing a ...
research
∙
11/24/2020
Min-Sum Clustering (with Outliers)
We give a constant factor polynomial time pseudo-approximation algorithm...
research
∙
02/27/2019
