The integrality gap of the Goemans--Linial SDP relaxation for Sparsest Cut is at least a constant multiple of sqrt{log n}
classification
💻 cs.DS
keywords
goemans--linialintegralityrelaxationsparsestsqrtconstantinputsleast
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.