The Complexity Landscape of Fixed-Parameter Directed 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%2F16%3A10335088" target="_blank" >RIV/00216208:11320/16:10335088 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.27" target="_blank" >http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.27</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.27" target="_blank" >10.4230/LIPIcs.ICALP.2016.27</a>
Alternative languages
Result language
angličtina
Original language name
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
Original language description
Given a directed graph G and a list (s_1, t_1), ..., (s_k, t_k) of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of G that contains a directed s_i -> t_i path for every 1 <= i <= k. The special case Directed Steiner Tree (when we ask for paths from a root r to terminals t_1, . . . , t_k) is known to be fixed-parameter tractable parameterized by the number of terminals, while the special case Strongly Connected Steiner Subgraph (when we ask for a path from every t_i to every other t_j ) is known to be W[1]-hard parameterized by the number of terminals. We systematically explore the complexity landscape of directed Steiner problems to fully understand which other special cases are FPT or W[1]-hard.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2016
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
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
ISBN
978-3-95977-013-2
ISSN
1868-8969
e-ISSN
—
Number of pages
14
Pages from-to
1-14
Publisher name
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Place of publication
Dagstuhl, Německo
Event location
Řím, Itálie
Event date
Jul 12, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—