Provides tight FPT-time (3+ε)-approximations for capacitated general-norm k-clustering and (1 + 2/(e c) + ε) for top-cn norm k-clustering, plus a bicriteria result.
The capacitatedk-center problem.SIAM Journal on Discrete Mathematics, 13(3):403–418, 2000
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Tight FPT Time Approximation Algorithms for k-Clustering Problems
Provides tight FPT-time (3+ε)-approximations for capacitated general-norm k-clustering and (1 + 2/(e c) + ε) for top-cn norm k-clustering, plus a bicriteria result.