Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs.
Pravesh K. KothariRaghu MekaPrasad RaghavendraPublished in: SIAM J. Comput. (2022)
Keyphrases
- lower bound
- lp relaxation
- integrality gap
- constraint satisfaction problems
- optimal solution
- upper bound
- linear programming
- np hard
- learning theory
- knapsack problem
- linear programming relaxation
- branch and bound
- linear program
- branch and bound algorithm
- objective function
- integer programming formulation
- integer program
- constraint satisfaction
- feasible solution
- message passing
- worst case
- constraint propagation
- energy minimization
- randomly generated problems
- search space
- global constraints
- column generation
- lower and upper bounds
- arc consistency
- integer programming
- np complete
- maximum a posteriori
- maximum likelihood
- greedy algorithm