Abstract
We initiate a systematic parameterized complexity study of three fundamental 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 parameters "number of terminals", "an upper bound on the size of the connecting network", and the combination of both. We achieve several parameterized hardness as well as some fixed-parameter tractability results, in this way significantly extending previous results of Feldman and Ruhl [SIAM J. Comp. 2006]. © 2009 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Guo, J., Niedermeier, R., & Suchý, O. (2009). Parameterized complexity of arc-weighted directed steiner problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 544–553). https://doi.org/10.1007/978-3-642-10631-6_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
