On exact algorithms for treewidth.
Hans L. BodlaenderFedor V. FominArie M. C. A. KosterDieter KratschDimitrios M. ThilikosPublished in: ACM Trans. Algorithms (2012)
Keyphrases
- exact algorithms
- bounded treewidth
- upper bound
- knapsack problem
- space complexity
- approximation algorithms
- benchmark instances
- search space
- exact solution
- boolean functions
- vehicle routing problem with time windows
- tree decompositions
- benders decomposition
- heuristic methods
- combinatorial optimization
- discrete random variables
- nonlinear programming
- combinatorial problems
- max sat
- computational problems
- combinatorial optimization problems
- arc consistency
- np complete
- worst case
- lower bound
- data structure
- search strategy
- optimization problems
- special case