The expected relative error of the polyhedral approximation of the max-cut problem

Svatopluk Poljak, Zsolt Tuza

Research output: Contribution to journalArticle

16 Citations (Scopus)

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 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.

Original languageEnglish
Pages (from-to)191-198
Number of pages8
JournalOperations Research Letters
Volume16
Issue number4
DOIs
Publication statusPublished - Nov 1994

Keywords

  • Maximum cut
  • Polyhedral relaxation
  • Random graph

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The expected relative error of the polyhedral approximation of the max-cut problem'. Together they form a unique fingerprint.

  • Cite this