| 摘 要： | <正>An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance XU Bao Gang,YU Xing Xing,ZHANG Xiao YanZHANG Zan-Bo Abstract We consider the design of semidefinite programming(SDP)based approximation algorithm for the problem Max Hypergraph Cut with Limited Unbalance(MHC-LU):Find a partition of the vertices of a weighted hypergraph H=(V,E)into two subsets V1,V2with||V2|-|V1||u for some given u and maximizing the total weight of the edges meeting both V1and V2.The problem MHC-LU generalizes several other combinatorial
|
