Near-linear time approximations schemes for clustering in doubling metrics
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10406069" target="_blank" >RIV/00216208:11320/19:10406069 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1109/FOCS.2019.00041" target="_blank" >https://doi.org/10.1109/FOCS.2019.00041</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/FOCS.2019.00041" target="_blank" >10.1109/FOCS.2019.00041</a>
Alternative languages
Result language
angličtina
Original language name
Near-linear time approximations schemes for clustering in doubling metrics
Original language description
We consider the classic Facility Location, k-Median, and k-Means problems in metric spaces of constant doubling dimension. We give the first nearly linear-Time approximation schemes for each problem, making a significant improvement over the state-of-The-Art algorithms. Moreover, we show how to extend the techniques used to get the first efficient approximation schemes for the problems of prize-collecting k-Medians and k-Means, and efficient bicriteria approximation schemes for k-Medians with outliers, k-Means with outliers and k-Center.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GJ17-10090Y" target="_blank" >GJ17-10090Y: Network Optimization</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
ISBN
978-1-72814-953-0
ISSN
1523-8288
e-ISSN
—
Number of pages
20
Pages from-to
540-559
Publisher name
IEEE
Place of publication
USA
Event location
Baltimore, Maryland
Event date
Nov 9, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—