2000 character limit reached
The integrality gap of the Goemans--Linial SDP relaxation for Sparsest Cut is at least a constant multiple of $\sqrt{\log n}$ (1704.01200v1)
Published 4 Apr 2017 in cs.DS
Abstract: 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.