The integrality gap of the Goemans--Linial SDP relaxation for Sparsest Cut is at least a constant multiple of $\sqrt{\log n}$

Assaf Naor, Robert Young

We prove that the integrality gap of the Goemans--Linial semidefinite programming relaxation for the Sparsest Cut Problem is $\Omega(\sqrt{\log n})$ on inputs with $n$ vertices.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment