The authors give FPT (1+ε)-approximation algorithms for Min-Sum Radii clustering in time (1/ε)^{O(k/ε log 1/ε)} n^{poly(1/ε)} and for Min-Sum Diameters in time (1/ε)^k n^{O(1)}.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
The authors give FPT (1+ε)-approximation algorithms for Min-Sum Radii clustering in time (1/ε)^{O(k/ε log 1/ε)} n^{poly(1/ε)} and for Min-Sum Diameters in time (1/ε)^k n^{O(1)}.