Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures.
Toniann PitassiNathan SegerlindPublished in: SIAM J. Comput. (2012)
Keyphrases
- lower bound
- upper bound
- linear programming relaxation
- tree structure
- objective function
- average case complexity
- branch and bound algorithm
- np hard
- optimal solution
- branch and bound
- lower and upper bounds
- binary tree
- index structure
- linear systems
- stable set
- worst case
- b tree
- vc dimension
- mixed integer
- quadratic assignment problem
- learning algorithm