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

Authors:
Amir Beck;Marc Teboulle
Affiliations:
School of Mathematical Sciences, Department of Statistic and Operations Research, Tel-Aviv University, Ramat-Aviv 69978, Tel Aviv, Israel;School of Mathematical Sciences, Department of Statistic and Operations Research, Tel-Aviv University, Ramat-Aviv 69978, Tel Aviv, Israel
Venue:
Operations Research Letters
Year:
2000

Citing 4
Cited 0

Laplacian eigenvalues and the maximum cut problem

Mathematical Programming: Series A and B
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Semidefinite programming in combinatorial optimization

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the max-cut problem on a random graph G with n vertices and weights w"i"j being independent bounded random variables with the same fixed positive expectation @m and variance @s^2. It is well known that the max-cut number mc(G) always exceeds 12@?"i"~.