Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10387193" target="_blank" >RIV/00216208:11320/18:10387193 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4230/LIPIcs.ESA.2018.20" target="_blank" >https://doi.org/10.4230/LIPIcs.ESA.2018.20</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.ESA.2018.20" target="_blank" >10.4230/LIPIcs.ESA.2018.20</a>
Alternative languages
Result language
angličtina
Original language name
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
Original language description
The Directed Steiner Network (DSN) problem takes as input a directed edge-weighted graph G=(V,E) and a set {D}subseteq V x V of k demand pairs. The aim is to compute the cheapest network N subseteq G for which there is an s -> t path for each (s,t)in {D}. It is known that this problem is notoriously hard as there is no k^{1/4-o(1)}-approximation algorithm under Gap-ETH, even when parameterizing the runtime by k [Dinur & Manurangsi, ITCS 2018]. In light of this, we systematically study several special cases of DSN and determine their parameterized approximability for the parameter k.
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
2018
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
26th Annual European Symposium on Algorithms (ESA 2018)
ISBN
978-3-95977-081-1
ISSN
1868-8969
e-ISSN
neuvedeno
Number of pages
16
Pages from-to
1-16
Publisher name
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Place of publication
Dagstuhl, Germany
Event location
Helsinki, Finland
Event date
Aug 20, 2018
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—