MAX-CUT has a randomized approximation scheme in dense graphs

• 1 May 1996
• journal article
• research article
• Published by Wiley in Random Structures & Algorithms
• Vol. 8  (3) , 187-198
• https://doi.org/10.1002/(sici)1098-2418(199605)8:3<187::aid-rsa3>3.0.co;2-u

Abstract

Keywords

• CUT
• SCHEME
• JOHN
• OUTPUTS
• MINIMUM
• SONS
• ACYCLIC
• SUBGRAPH
• GIVE