Treewidth Lower Bounds with Brambles.
Hans L. BodlaenderAlexander GrigorievArie M. C. A. KosterPublished in: Algorithmica (2008)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- worst case
- np hard
- search space
- lower and upper bounds
- objective function
- upper and lower bounds
- sample complexity
- bounded treewidth
- lower bounding
- optimal solution
- space complexity
- sample size
- optimal cost
- vc dimension
- linear programming relaxation
- np complete
- randomly generated problems