Balanced Judicious Bipartition is Fixed-Parameter Tractable.
Daniel LokshtanovSaket SaurabhRoohani SharmaMeirav ZehaviPublished in: FSTTCS (2017)
Keyphrases
- fixed parameter tractable
- parameterized complexity
- computational problems
- np complete
- np hard
- global constraints
- conjunctive queries
- bounded treewidth
- abstract argumentation
- special case
- search space
- knapsack problem
- relational data
- constraint programming
- constraint satisfaction problems
- vertex set
- optimization problems