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%2F22%3A10451326" target="_blank" >RIV/00216208:11320/22:10451326 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-031-15914-5_16" target="_blank" >https://doi.org/10.1007/978-3-031-15914-5_16</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-031-15914-5_16" target="_blank" >10.1007/978-3-031-15914-5_16</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 (CKSWO) problem, we show an efficient parameterized approximation scheme (EPAS) when the parameters are k, the number of outliers and the doubling dimension of 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
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
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
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
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2022)
ISBN
978-3-031-15913-8
ISSN
0302-9743
e-ISSN
1611-3349
Number of pages
15
Pages from-to
215-229
Publisher name
SPRINGER INTERNATIONAL PUBLISHING AG
Place of publication
CHAM
Event location
Tubingen
Event date
Jun 22, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000866013700016