,
Tomohiro Koana
,
Jesper Nederlof
,
Shengzhe Wang
Creative Commons Attribution 4.0 International license
The Strongly Connected Steiner Subgraph (SCSS) problem is a well-studied network design problem that asks for a minimum subgraph that strongly connects a given set of terminals. In this paper, we present several new algorithmic and complexity results for SCSS.
As our main result, we show that SCSS can be solved in time 17^{tw} n^O(1) on directed graphs with n vertices when a tree decomposition of the underlying graph of width tw is provided. This improves upon the natural tw^O(tw) n^O(1) time algorithm, and to the best of our knowledge is the first algorithm with this kind of running time for a problem involving strong connectivity.
Second, we give an exact exponential-time algorithm that solves SCSS in 2^n n^O(1) time, improving the known bounds for general directed graphs.
Finally, we investigate kernelization with respect to vertex cover. We prove that SCSS does not admit a polynomial kernel when parameterized by the size of a vertex cover, unless the polynomial hierarchy collapses. In contrast, we show that the closely related Strongly Connected Spanning Subgraph problem does admit a polynomial kernel under the same parameterization.
@InProceedings{ameli_et_al:LIPIcs.IPEC.2026.15,
author = {Ameli, Afrouz Jabal and Koana, Tomohiro and Nederlof, Jesper and Wang, Shengzhe},
title = {{New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.15},
URN = {urn:nbn:de:0030-drops-281885},
doi = {10.4230/LIPIcs.IPEC.2026.15},
annote = {Keywords: Strongly connected Steiner subgraph, parameterized complexity, treewidth, exact exponential time algorithms}
}