A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints.
Kenya UenoPublished in: STACS (2009)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- branch and bound algorithm
- branch and bound
- optimal solution
- np hard
- objective function
- maximum clique
- integer programming formulations
- constant factor
- linear programming
- running times
- worst case
- linear programming relaxation
- computational complexity
- vc dimension
- column generation
- constraint satisfaction
- upper and lower bounds
- integer programming
- linear program
- global constraints
- integer program
- memory requirements
- sample complexity
- uniform distribution
- space complexity
- mixed integer
- special case
- integer solution