FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering

Fabrizio Grandoni, Anupam Gupta, Jatin Yadav

In the classical Min-Sum Radii problem (MSR) we are given a set $X$ of $n$ points in a metric space and a positive integer $k\in [n]$. Our goal is to partition $X$ into $k$ subsets…