Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms.
David CattanéoSimon PerdrixPublished in: CoRR (2015)
Keyphrases
- exact algorithms
- parameterized complexity
- computational problems
- fixed parameter tractable
- knapsack problem
- approximation algorithms
- exact solution
- lower bound
- combinatorial optimization
- upper bound
- combinatorial problems
- heuristic methods
- max sat
- combinatorial optimization problems
- minimum cost
- worst case
- global constraints
- knowledge base
- learning algorithm
- np hard
- evolutionary algorithm
- constraint satisfaction
- tabu search