Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2020.5
URN: urn:nbn:de:0030-drops-133495
URL: https://drops.dagstuhl.de/opus/volltexte/2020/13349/
Feng, Qilong ; Zhang, Zhen ; Huang, Ziyun ; Xu, Jinhui ; Wang, Jianxin
A Unified Framework of FPT Approximation Algorithms for Clustering Problems
| pdf-format: |
|
Abstract
In this paper, we present a framework for designing FPT approximation algorithms for many k-clustering problems. Our results are based on a new technique for reducing search spaces. A reduced search space is a small subset of the input data that has the guarantee of containing k clients close to the facilities opened in an optimal solution for any clustering problem we consider. We show, somewhat surprisingly, that greedily sampling O(k) clients yields the desired reduced search space, based on which we obtain FPT(k)-time algorithms with improved approximation guarantees for problems such as capacitated clustering, lower-bounded clustering, clustering with service installation costs, fault tolerant clustering, and priority clustering.
BibTeX - Entry
@InProceedings{feng_et_al:LIPIcs:2020:13349,
author = {Qilong Feng and Zhen Zhang and Ziyun Huang and Jinhui Xu and Jianxin Wang},
title = {{A Unified Framework of FPT Approximation Algorithms for Clustering Problems}},
booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)},
pages = {5:1--5:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-173-3},
ISSN = {1868-8969},
year = {2020},
volume = {181},
editor = {Yixin Cao and Siu-Wing Cheng and Minming Li},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13349},
URN = {urn:nbn:de:0030-drops-133495},
doi = {10.4230/LIPIcs.ISAAC.2020.5},
annote = {Keywords: clustering, approximation algorithms, fixed-parameter tractability}
}
| Keywords: | clustering, approximation algorithms, fixed-parameter tractability | |
| Seminar: | 31st International Symposium on Algorithms and Computation (ISAAC 2020) | |
| Issue date: | 2020 | |
| Date of publication: | 04.12.2020 |
