Author:
Li Guangfeng,Sun Jian,Sun Zhiren,Du Donglei,Zhang Xiaoyan
Reference22 articles.
1. Rounding semidefinite programming hierarchies via global correlation[C]. 2011 ieee 52nd annual symposium on foundations of computer science;B Barak;IEEE,2011
2. An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance;G Xu,2014
3. An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems[J];C Wu;Journal of Combinatorial Optimization,2015
4. An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding[J];C Wu;Journal of Combinatorial Optimization,2016