We study the expected relative error of a linear relaxation of the max-cut problem in the random graph Gn,p. We prove that this error tends to 1 3 as n → ∞ of the edge probability p = p(n) is at least Ω(√logn/n), and tends to 1 if pn → ∞ and pn1-a → 0 for all a > 0.
- Maximum cut
- Polyhedral relaxation
- Random graph
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics