The paper gives tight ETH-based lower bounds and matching algorithms for Minimum Stable Cut parameterized by treewidth and degree, plus an FPT approximation scheme for almost-stable cuts.
Paschos , authortext =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Broadcast Independence and Broadcast Packing are FPT parameterized by treewidth plus diameter via DP on nice tree decompositions, W[1]-hard for pathwidth, and admit a constant-factor approximation parameterized by treewidth.
citing papers explorer
-
On the parameterized complexity of Broadcast Independence and Broadcast Packing
Broadcast Independence and Broadcast Packing are FPT parameterized by treewidth plus diameter via DP on nice tree decompositions, W[1]-hard for pathwidth, and admit a constant-factor approximation parameterized by treewidth.