Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability).
Tanmay InamdarDaniel LokshtanovSaket SaurabhVaishali SurianarayananPublished in: ESA (2023)
Keyphrases
- parameterized complexity
- fixed parameter tractable
- vertex set
- computational problems
- np hard
- np complete
- global constraints
- approximation algorithms
- bounded treewidth
- abstract argumentation
- conjunctive queries
- constraint satisfaction problems
- database systems
- weighted graph
- constraint satisfaction
- reasoning tasks
- special case
- computational complexity
- search algorithm