On a positive semidefinite relaxation of the cut polytope

[1]  Franz Rendl,et al.  Nonpolyhedral Relaxations of Graph-Bisection Problems , 1995, SIAM J. Optim..

[2]  Chi-Kwong Li,et al.  A Note on Extreme Correlation Matrices , 1994, SIAM J. Matrix Anal. Appl..

[3]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[4]  Charles Delorme,et al.  Laplacian eigenvalues and the maximum cut problem , 1993, Math. Program..

[5]  Charles Delorme,et al.  Combinatorial Properties and the Complexity of a Max-cut Approximation , 1993, Eur. J. Comb..

[6]  Charles Delorme,et al.  The performance of an eigenvalue bound on the max-cut problem in some classes of graphs , 1993, Discret. Math..

[7]  Michel Deza,et al.  Facets for the cut cone I , 1992, Math. Program..

[8]  Wei-Min Liu,et al.  The cone of distance matrices , 1991 .

[9]  R. Grone,et al.  Extremal correlation matrices , 1990 .

[10]  N. Biggs.  GEOMETRIC ALGORITHMS AND COMBINATORIAL OPTIMIZATION: (Algorithms and Combinatorics 2) , 1990 .

[11]  Janny Leung,et al.  Geometric Algorithms and Combinatorial Optimization , 1989 .

[12]  R. D. Hill,et al.  On the cone of positive semidefinite matrices , 1987 .

[13]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..

[14]  R. Fletcher.  Semi-Definite Matrix Constraints in Optimization , 1985 .

[15]  R. Loewy.  Extreme points of a convex subset of the cone of positive semidefinite matrices , 1980 .

[16]  J. Christensen,et al.  A note on extreme positive definite matrices , 1979 .

[17]  G. P. Barker,et al.  Cones of diagonally dominant matrices , 1975 .

[18]  I. J. Schoenberg.  Remarks to Maurice Frechet's Article ``Sur La Definition Axiomatique D'Une Classe D'Espace Distances Vectoriellement Applicable Sur L'Espace De Hilbert , 1935 .

[19]  M. Fréchet.  Sur La Definition Axiomatique D'Une Classe D'Espaces Vectoriels Distancies Applicables Vectoriellement Sur L'Espace de Hilbert , 1935 .

[20]  Satissed Now Consider.  Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming , 1997 .

[21]  R. Vanderbei,et al.  Interior point methods for max - min eigenvalue problems , 1993 .

[22]  Michel Deza,et al.  The cut cone III: On the role of triangle facets , 1992, Graphs Comb..

[23]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Siam J. CoMPtrr,et al.  FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .