Artykuł w czasopiśmie
Brak miniatury
Licencja
CC-BY - Uznanie autorstwaConstant-factor FPT approximation for capacitated k-median
| dc.abstract.en | Capacitated k-median is one of the few outstanding optimization problems for which the existence of a polynomial time constant factor approximation algorithm remains an open problem. In a series of recent papers algorithms producing solutions violating either the number of facilities or the capacity by a multiplicative factor were obtained. However, to produce solutions without violations appears to be hard and potentially requires different algorithmic techniques. Notably, if parameterized by the number of facilities k, the problem is also W[2] hard, making the existence of an exact FPT algorithm unlikely. In this work we provide an FPT-time constant factor approximation algorithm preserving both cardinality and capacity of the facilities. The algorithm runs in time 2^O(k log k) n^O(1) and achieves an approximation ratio of 7+epsilon. |
| dc.affiliation | Uniwersytet Warszawski |
| dc.conference.country | Niemcy |
| dc.conference.datefinish | 2019-09-11 |
| dc.conference.datestart | 2019-09-09 |
| dc.conference.place | Munich/Garching |
| dc.conference.series | 27th Annual European Symposium on Algorithms |
| dc.conference.series | 27th Annual European Symposium on Algorithms |
| dc.conference.shortcut | ESA 2019 |
| dc.contributor.author | Marcinkowski, Jan |
| dc.contributor.author | Byrka, Jarosław |
| dc.contributor.author | Meesum, Syed Mohammad |
| dc.contributor.author | Włodarczyk, Michał |
| dc.contributor.author | Adamczyk, Marek |
| dc.date.accessioned | 2024-01-24T20:07:40Z |
| dc.date.available | 2024-01-24T20:07:40Z |
| dc.date.issued | 2019 |
| dc.description.accesstime | AT_PUBLICATION |
| dc.description.finance | Nie dotyczy |
| dc.description.version | FINAL_PUBLISHED |
| dc.identifier.doi | 10.4230/LIPICS.ESA.2019.1 |
| dc.identifier.uri | https://repozytorium.uw.edu.pl//handle/item/103594 |
| dc.identifier.weblink | https://doi.org/10.4230/LIPIcs.ESA.2019.1 |
| dc.language | eng |
| dc.pbn.affiliation | computer and information sciences |
| dc.relation.pages | 1:1-1:14 |
| dc.rights | CC-BY |
| dc.sciencecloud | nosend |
| dc.subject.en | K-median |
| dc.subject.en | Clustering |
| dc.subject.en | Approximation Algorithms |
| dc.subject.en | Fixed Parameter Tractability |
| dc.title | Constant-factor FPT approximation for capacitated k-median |
| dc.type | JournalArticle |
| dspace.entity.type | Publication |