Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Increasing digraph arc-connectivity by arc addition, reversal and complement
Discrete Applied Mathematics
The Directed Steiner Network Problem Is Tractable for a Constant Number of Terminals
SIAM Journal on Computing
On Problems without Polynomial Kernels (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Directed nowhere dense classes of graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
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].