Denise La Gordt Dillie

Improved Guarantees for Fully Dynamic $k$-Center Clustering with Outliers in General Metric Spaces

The metric $k$-center clustering problem with $z$ outliers, also known as $(k,z)$-center clustering, involves clustering a given point set $P$ in a metric space $(M,d)$ using at most $k$ balls, minimizing the maximum ball radius while excluding up to $z$ points from the clustering. This problem h…