Integrality Gap for the Sparsest Cut SDP.
Jeff CheegerBruce KleinerAssaf NaorPublished in: FOCS (2009)
Keyphrases
- integrality gap
- linear programming relaxation
- semi definite programming
- linear program
- lower bound
- linear programming
- arbitrarily close
- approximation algorithms
- tight upper and lower bounds
- valid inequalities
- lp relaxation
- semidefinite programming
- primal dual
- finite number
- optimal solution
- column generation
- mixed integer programming
- knapsack problem
- low degree
- kernel matrix
- truth table
- integer program
- feasible solution
- np hardness
- branch and bound
- objective function
- integer programming formulation
- trust region
- semidefinite
- convex optimization
- integer programming
- combinatorial optimization
- np hard
- special case