A novel formulation of the max-cut problem and related algorithm

摘要

In this paper, a new formulation of the max-cut problem is proposed. Several semidefinite programming(SDP) relaxations of the max-cut problem are given and some relationships between them are put forward. Based on a new SDP relaxation, an algorithm is presented for finding a better approximate solution of the max-cut problem and we show the advantages of our model and algorithm with several examples.