License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2019.42
URN: urn:nbn:de:0030-drops-106182
URL: http://drops.dagstuhl.de/opus/volltexte/2019/10618/
Go to the corresponding LIPIcs Volume Portal


Cohen-Addad, Vincent ; Gupta, Anupam ; Kumar, Amit ; Lee, Euiwoong ; Li, Jason

Tight FPT Approximations for k-Median and k-Means

pdf-format:
LIPIcs-ICALP-2019-42.pdf (0.5 MB)


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+epsilon) and (1+8/e+epsilon) 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.

BibTeX - Entry

@InProceedings{cohenaddad_et_al:LIPIcs:2019:10618,
  author =	{Vincent Cohen-Addad and Anupam Gupta and Amit Kumar and Euiwoong Lee and Jason Li},
  title =	{{Tight FPT Approximations for k-Median and k-Means}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{42:1--42:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10618},
  URN =		{urn:nbn:de:0030-drops-106182},
  doi =		{10.4230/LIPIcs.ICALP.2019.42},
  annote =	{Keywords: approximation algorithms, fixed-parameter tractability, k-median, k-means, clustering, core-sets}
}

Keywords: approximation algorithms, fixed-parameter tractability, k-median, k-means, clustering, core-sets
Seminar: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Issue Date: 2019
Date of publication: 08.07.2019


DROPS-Home | Imprint | Privacy Published by LZI