Tight FPT Approximations for k-Median and k-Means - Archive ouverte HAL Access content directly
Conference Papers Year :

Tight FPT Approximations for k-Median and k-Means

Amit Kumar
  • Function : Author
Euiwoong Lee
  • Function : Author
Jason Li
  • Function : Author


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
Fichier principal
Vignette du fichier
main 13.pdf (557.58 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-02360773 , version 1 (15-11-2019)



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⟩
77 View
72 Download



Gmail Facebook Twitter LinkedIn More