Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F13%3A00209349" target="_blank" >RIV/68407700:21240/13:00209349 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-40450-4_57" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-40450-4_57</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-40450-4_57" target="_blank" >10.1007/978-3-642-40450-4_57</a>
Alternative languages
Result language
angličtina
Original language name
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
Original language description
We study the parameterized complexity of the directed variant of the classical Steiner Tree problem on various classes of directed sparse graphs. While the parameterized complexity of Steiner Tree parameterized by the number of terminals is well understood, not much is known about the parameterization by the number of non-terminals in the solution tree. All that is known for this parameterization is that both the directed and the undirected versions are W[2]-hard on general graphs, and hence unlikely tobe fixed parameter tractable (FPT). The undirected Steiner Tree problem becomes FPT when restricted to sparse classes of graphs such as planar graphs, but the techniques used to show this result break down on directed planar graphs. In this article we precisely chart the tractability border for Directed Steiner Tree (DST) on sparse graphs parameterized by the number of non-terminals in the solution tree. Specifically, we show that the problem is fixed parameter tractable on graphs exclu
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
2013
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
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISBN
978-3-642-40449-8
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
671-682
Publisher name
Springer Science+Business Media
Place of publication
Berlin
Event location
Sophia Antipolis
Event date
Sep 2, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—