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)}.
5 Babak Behsaz and Mohammad R
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
MSR is W[1]-hard parameterized by k+Delta on weighted bipartite graphs and by vertex cover number plus k, but FPT parameterized by treewidth plus Delta on weighted graphs.
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)}.
-
On the Parameterized Complexity of Min-Sum-Radii
MSR is W[1]-hard parameterized by k+Delta on weighted bipartite graphs and by vertex cover number plus k, but FPT parameterized by treewidth plus Delta on weighted graphs.