SCSS solves in 17^tw n^O(1) time given treewidth tw, in 2^n time exactly, and admits no polynomial kernel by vertex cover size unless the polynomial hierarchy collapses.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
SCSS solves in 17^tw n^O(1) time given treewidth tw, in 2^n time exactly, and admits no polynomial kernel by vertex cover size unless the polynomial hierarchy collapses.