# Subexponential LPs Approximate Max-Cut

FOCS, pp. 943-953, 2019.

Cited by: 2|Views8
EI

Abstract:

We show that for every $\varepsilon > 0$, the degree-$n^\varepsilon$ Sherali-Adams linear program (with $\exp(\tilde{O}(n^\varepsilon))$ variables and constraints) approximates the maximum cut problem within a factor of $(\frac{1}{2}+\varepsilon')$, for some $\varepsilon'(\varepsilon) > 0$. Our result provides a surprising converse to k...More

Code:

Data:

Full Text
Bibtex