On Exact Algorithms for Treewidth.
Hans L. BodlaenderFedor V. FominArie M. C. A. KosterDieter KratschDimitrios M. ThilikosPublished in: ESA (2006)
Keyphrases
- exact algorithms
- knapsack problem
- space complexity
- upper bound
- bounded treewidth
- search space
- exact solution
- benchmark instances
- approximation algorithms
- vehicle routing problem with time windows
- boolean functions
- computational problems
- combinatorial optimization
- combinatorial optimization problems
- heuristic methods
- max sat
- combinatorial problems
- discrete random variables
- tree decompositions
- benders decomposition
- lower bound
- np complete
- worst case
- nonlinear programming
- machine learning
- np hard
- multi objective
- test collection
- optimization problems
- evolutionary algorithm
- objective function