Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms.
David CattanéoSimon PerdrixPublished in: ISAAC (2015)
Keyphrases
- exact algorithms
- parameterized complexity
- computational problems
- fixed parameter tractable
- knapsack problem
- approximation algorithms
- exact solution
- lower bound
- combinatorial optimization
- upper bound
- worst case
- combinatorial optimization problems
- heuristic methods
- max sat
- combinatorial problems
- minimum cost
- global constraints
- special case