Bounded-size coalition formation is FPT for treewidth-plus-capacity and vertex cover, W[1]-hard for tree-depth alone, and admits a polynomial kernel only in the unweighted case.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
Bounded-size coalition formation is FPT for treewidth-plus-capacity and vertex cover, W[1]-hard for tree-depth alone, and admits a polynomial kernel only in the unweighted case.