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

Authors:
Svatopluk Poljak;Zsolt Tuza
Affiliations:
Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské námstí 25, 118 00 Praha 1, Czech Republic;Hungarian Academy of Sciences, H-1111 Budapest, Kende u. 13-17, Hungary
Venue:
Operations Research Letters
Year:
1994

Citing 7
Cited 0

On the cut polytope

Mathematical Programming: Series A and B
An application of combinatorial optimization to statistical physics and circuit layout design

Operations Research
Experiments in quadratic 0-1 programming

Mathematical Programming: Series A and B
The spectrum of &lgr;-times repeated blocks for TS(&ngr;,&lgr;)

Proceedings of the first International conference on Linear spaces
.879-approximation algorithms for MAX CUT and MAX 2SAT

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Laplacian eigenvalues and the maximum cut problem

Mathematical Programming: Series A and B
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 study the expected relative error of a linear relaxation of the max-cut problem in the random graph G"n","p. We prove that this error tends to 13 as n - ~ of the edge probability p = p(n) is at least @W(@/logn/n), and tends to 1 if pn - ~ and pn^1^-^a - 0 for all a 0.