Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization.
Guilherme de C. M. GomesIgnasi SauPublished in: CoRR (2019)
Keyphrases
- exact algorithms
- knapsack problem
- exact solution
- computational problems
- approximation algorithms
- fixed parameter tractable
- combinatorial optimization
- combinatorial optimization problems
- heuristic methods
- combinatorial problems
- space complexity
- max sat
- bounded treewidth
- decision problems
- multi objective
- information retrieval
- bounded degree
- graph theoretic
- relational data
- metaheuristic
- optimization problems
- dynamic programming
- cost function
- reinforcement learning