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
Document type :
Conference papers
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02360773
Contributor : Vincent Cohen-Addad <>
Submitted on : Friday, November 15, 2019 - 8:59:12 AM
Last modification on : Friday, November 22, 2019 - 1:34:03 AM
Long-term archiving on: Sunday, February 16, 2020 - 12:36:40 PM

File

main 13.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li. Tight FPT Approximations for k-Median and k-Means. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Jul 2019, Patras, Greece. pp.42:1--42:14, ⟨10.4230/LIPIcs.ICALP.2019.42⟩. ⟨hal-02360773⟩

Share

Metrics

Record views

21

Files downloads

19