Abstract
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 13 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
