A $(\log n)^{\Omega(1)}$ integrality gap for the Sparsest Cut SDP
Jeff CheegerBruce KleinerAssaf NaorPublished in: CoRR (2009)
Keyphrases
- integrality gap
- lower bound
- linear programming relaxation
- semi definite programming
- arbitrarily close
- linear program
- term dnf
- tight upper and lower bounds
- linear programming
- upper bound
- approximation algorithms
- valid inequalities
- worst case
- primal dual
- knapsack problem
- truth table
- semidefinite programming
- dnf formulas
- objective function
- learning dnf
- lp relaxation
- integer programming formulation
- low degree
- uniform distribution
- column generation
- optimal solution
- np hard
- finite number
- cutting plane
- approximation guarantees
- decision lists
- trust region
- integer programming
- integer program
- feasible solution
- branch and bound
- mixed integer programming
- mixed integer
- lower and upper bounds
- metric learning
- np hardness
- randomly generated problems
- graph cuts