The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n.
Assaf NaorRobert YoungPublished in: STOC (2017)
Keyphrases
- integrality gap
- arbitrarily close
- linear programming relaxation
- lower bound
- linear program
- approximation algorithms
- finite number
- valid inequalities
- linear programming
- semi definite programming
- tight upper and lower bounds
- lp relaxation
- branch and bound
- low degree
- primal dual
- optimal solution
- truth table
- integer programming
- worst case
- upper bound
- knapsack problem
- mixed integer programming
- feasible solution
- agnostic learning
- term dnf
- np hardness
- column generation
- cutting plane
- integer program
- message passing
- branch and bound algorithm
- search algorithm
- semidefinite
- integer programming formulation
- convex hull
- dynamic programming
- np hard