supported by National Natural Science Foundation of China(Grant Nos.11171160,11331003 and 11471003);the Priority Academic Program Development of Jiangsu Higher Education Institutions;the Natural Science Foundation of the Jiangsu Higher Education Institutions of China(Grant No.13KJB1100188);Natural Science Foundation of Guangdong Province(Grant No.S2012040007521);Sienceand Technology Planning Project in Guangzhou(Grant No.2013J4100077)
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...