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: CoRR (2017)
Keyphrases
- integrality gap
- linear programming relaxation
- arbitrarily close
- lower bound
- linear program
- finite number
- tight upper and lower bounds
- linear programming
- valid inequalities
- approximation algorithms
- lp relaxation
- knapsack problem
- semi definite programming
- optimal solution
- primal dual
- low degree
- upper bound
- worst case
- learning dnf
- integer programming formulation
- mixed integer programming
- truth table
- feasible solution
- branch and bound
- dnf formulas
- dynamic programming
- column generation
- integer programming
- semidefinite programming
- np hardness
- mixed integer
- lower and upper bounds
- evolutionary algorithm
- search algorithm
- objective function