Tight FPT Approximations for k-Median and k-Means
Abstract
We investigate the fine-grained complexity of approximating the classical k-Median/k-Means clustering problems in general metric spaces. We show how to improve the approximation factors to (1 + 2/e + ε) and (1 + 8/e + ε) respectively, using algorithms that run in fixed-parameter time. Moreover, we show that we cannot do better in FPT time, modulo recent complexity-theoretic conjectures. 2012 ACM Subject Classification Theory of computation → Facility location and clustering; Theory of computation → Fixed parameter tractability; Theory of computation → Submodular optimization and polymatroids
Origin : Publisher files allowed on an open archive
Loading...