Exponential lower bounds and integrality gaps for tree-like Lovasz-Schrijver procedures.
Nathan SegerlindToniann PitassiPublished in: Electron. Colloquium Comput. Complex. (2007)
Keyphrases
- lower bound
- linear programming relaxation
- upper bound
- average case complexity
- branch and bound
- np hard
- tree structure
- upper and lower bounds
- lower and upper bounds
- branch and bound algorithm
- objective function
- hierarchical structure
- r tree
- b tree
- worst case
- binary tree
- optimal solution
- mixed integer
- leaf nodes
- mixed integer programming
- spanning tree
- knapsack problem
- linear space
- quadratic assignment problem
- optimal cost
- tree nodes
- stable set
- feasible solution