Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs.
Pravesh K. KothariRaghu MekaPrasad RaghavendraPublished in: STOC (2017)
Keyphrases
- lower bound
- lp relaxation
- optimal solution
- constraint satisfaction problems
- integrality gap
- upper bound
- np hard
- linear programming
- learning theory
- integer programming formulation
- linear program
- integer programming
- linear programming relaxation
- randomly generated problems
- branch and bound algorithm
- message passing
- constraint satisfaction
- objective function
- knapsack problem
- global constraints
- valid inequalities
- lower and upper bounds
- branch and bound
- integer program
- constraint propagation
- arc consistency
- feasible solution
- search space
- cutting plane
- energy minimization
- worst case
- np complete
- exact solution
- cost function
- lagrangian relaxation
- max sat
- maximum a posteriori