半定规划(SDP)for 最大割
最大割问题:
Instance: given an undirected graph G(V,E), find a bipartition of V into S and T that maximizing the size of the cut E(S,T)= { uv∈E|u∈S,v∈T}
贪心算法、随机选择、局部查找算法能够达到的approximation ratio 都是 12 .
LP for Max-cut:
首先我们可以得到一个非线性的规划:
max ∑uv∈Eyuv
s.t. yuv≤|xu−xv|, ∀uv∈E
xv∈{ 0,1}, ∀v∈V
yuv 是对G中所有边进行赋值,如果u,v同属于一个sub-graph,则 |xu−xv|=0 , then yuv=0 , otherwise yuv