k-MSR is W[2]-hard parameterized by k with no EPAS unless W[2]=FPT, and admits an FPT (8/3+ε)-approximation under mergeable constraints, improving prior (4+ε) bounds.
Polynomial-time constant- approximation for fair sum-of-radii clustering
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
-
On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
k-MSR is W[2]-hard parameterized by k with no EPAS unless W[2]=FPT, and admits an FPT (8/3+ε)-approximation under mergeable constraints, improving prior (4+ε) bounds.