Parameterized Complexity of Arc-Weighted Directed Steiner Problems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10100632" target="_blank" >RIV/00216208:11320/11:10100632 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1137/100794560" target="_blank" >http://dx.doi.org/10.1137/100794560</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1137/100794560" target="_blank" >10.1137/100794560</a>

Result language
angličtina
Original language name
Parameterized Complexity of Arc-Weighted Directed Steiner Problems
Original language description
We start a systematic parameterized computational complexity study of three NP-hard network design problems on arc-weighted directed graphs: Directed Steiner Tree, Strongly Connected Steiner Subgraph, and Directed Steiner Network. We investigate their parameterized complexities with respect to the three parameterizations: "number of terminals," "an upper bound on the size of the connecting network," and the combination of these two. We achieve several parameterized hardness results as well as some fixed-parameter tractability results, in this way extending previous results of Feldman and Ruhl [SIAM J. Comput., 36 (2006), pp. 543-561].
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

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)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

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

Similar results(10)