Parameterized Approximation Schemes for Clustering with General Norm Objectives

Fateme Abbasi, Sandip Banerjee, Jarosław Byrka +6

This paper considers the well-studied algorithmic regime of designing a $(1+\epsilon )$-approximation algorithm for a $k$-clustering problem that runs in time $f(k,\epsilon )poly(n)$ (sometimes ca…