The Parameterized Hardness of the k-Center Problem in Transportation Networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10422908" target="_blank" >RIV/00216208:11320/20:10422908 - isvavai.cz</a>

Výsledek na webu

<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=Q7DrHtMS3Q" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=Q7DrHtMS3Q</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s00453-020-00683-w" target="_blank" >10.1007/s00453-020-00683-w</a>

Jazyk výsledku

angličtina

Název v původním jazyce

The Parameterized Hardness of the k-Center Problem in Transportation Networks

Popis výsledku v původním jazyce

In this paper we study the hardness of the ????-CENTER problem on inputs that model transportation networks. For the problem, a graph ????=(????,????) with edge lengths and an integer k are given and a center set ???? needs to be chosen such that |????|&lt;=????. The aim is to minimize the maximum distance of any vertex in the graph to the closest center. This problem arises in many applications of logistics, and thus it is natural to consider inputs that model transportation networks. Such inputs are often assumed to be planar graphs, low doubling metrics, or bounded highway dimension graphs. For each of these models, parameterized approximation algorithms have been shown to exist. We complement these results by proving that the ????-CENTER problem is W[1]-hard on planar graphs of constant doubling dimension, where the parameter is the combination of the number of centers k, the highway dimension h, and the pathwidth p.

Název v anglickém jazyce

The Parameterized Hardness of the k-Center Problem in Transportation Networks

Popis výsledku anglicky

In this paper we study the hardness of the ????-CENTER problem on inputs that model transportation networks. For the problem, a graph ????=(????,????) with edge lengths and an integer k are given and a center set ???? needs to be chosen such that |????|&lt;=????. The aim is to minimize the maximum distance of any vertex in the graph to the closest center. This problem arises in many applications of logistics, and thus it is natural to consider inputs that model transportation networks. Such inputs are often assumed to be planar graphs, low doubling metrics, or bounded highway dimension graphs. For each of these models, parameterized approximation algorithms have been shown to exist. We complement these results by proving that the ????-CENTER problem is W[1]-hard on planar graphs of constant doubling dimension, where the parameter is the combination of the number of centers k, the highway dimension h, and the pathwidth p.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GX19-27871X" target="_blank" >GX19-27871X: Efektivní aproximační algoritmy a obvodová složitost</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2020

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Algorithmica

ISSN

0178-4617

e-ISSN

—

Svazek periodika

82

Číslo periodika v rámci svazku

7

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

17

Strana od-do

1989-2005

Kód UT WoS článku

000515774300001

EID výsledku v databázi Scopus

2-s2.0-85078994342