Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable.
M. S. RamanujanStefan SzeiderPublished in: AAAI (2017)
Keyphrases
- fixed parameter tractable
- np hard
- np complete
- parameterized complexity
- bounded treewidth
- computational problems
- global constraints
- constraint satisfaction problems
- approximation algorithms
- special case
- conjunctive queries
- minimum cost
- lower bound
- satisfiability problem
- integer programming
- abstract argumentation
- exact algorithms
- knapsack problem
- data warehouse
- database