A probabilistic result for the max-cut problem on random graphs.

Amir Beck Marc Teboulle A probabilistic result for the max-cut problem on random graphs. 209-214 2000 27 Oper. Res. Lett. 5 http://dx.doi.org/10.1016/S0167-6377(00)00055-9 db/journals/orl/orl27.html#BeckT00