Generalized k-Center: Distinguishing Doubling and Highway Dimension
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10515264" target="_blank" >RIV/00216208:11320/25:10515264 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=OY9mUfgX5K" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=OY9mUfgX5K</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00453-025-01357-1" target="_blank" >10.1007/s00453-025-01357-1</a>
Alternative languages
Result language
angličtina
Original language name
Generalized k-Center: Distinguishing Doubling and Highway Dimension
Original language description
We consider generalizations of the k-CENTER problem in graphs of low doubling and highway dimension. For the CAPACITATED k-SUPPLIER wITH OUTLIERS (CK-SwO) problem, we show an efficient parameterized approximation scheme (EPAS) when the parameters are k, the number of outliers and the doubling dimension of the graph induced by the supplier set. On the other hand, we show that for the CAPACITATED k-CENTER problem, which is a special case of CKSwO, obtaining a parameterized approximation scheme (PAS) is W[1]-hard when the parameters are k, and the highway dimension. This is the first known example of a problem for which it is hard to obtain a PAS for highway dimension, while simultaneously admitting an EPAS for doubling dimension.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
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/LL2406" target="_blank" >LL2406: Robust Streaming Algorithms versus Adaptive Adversaries</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2025
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
Name of the periodical
Algorithmica
ISSN
0178-4617
e-ISSN
1432-0541
Volume of the periodical
88
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
36
Pages from-to
12
UT code for WoS article
001633601800002
EID of the result in the Scopus database
2-s2.0-105024072964