Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Paper:

TR06-104 | 25th August 2006 00:00

On the Sample Complexity of MAX-CUT

TR06-104
Authors: Wenceslas Fernandez de la Vega, Marek Karpinski
Publication: 25th August 2006 12:40
We give a simple proof for the sample complexity bound $O~(1/\epsilon^4)$ of absolute approximation of MAX-CUT. The proof depends on a new analysis method for linear programs (LPs) underlying MAX-CUT which could be also of independent interest.