An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding

[1]  D. Du,et al.  An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems , 2013, Journal of combinatorial optimization.

[2]  Dachuan Xu,et al.  An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems , 2013, J. Comb. Optim..

[3]  Konstantinos Georgiou,et al.  Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection , 2012, SODA.

[4]  Prasad Raghavendra,et al.  Approximating CSPs with global cardinality constraints using SDP hierarchies , 2011, SODA.

[5]  Ai-fan Ling,et al.  Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation , 2009, COCOA.

[6]  Salimur Choudhury,et al.  An Approximation Algorithm for Max k-Uncut with Capacity Constraints , 2009, 2009 International Joint Conference on Computational Sciences and Optimization.

[7]  Shuzhong Zhang,et al.  Complex Quadratic Optimization and Semidefinite Programming , 2006, SIAM J. Optim..

[8]  Jiawei Zhang,et al.  An improved rounding method and semidefinite programming relaxation for graph partition , 2002, Math. Program..

[9]  Jean B. Lasserre,et al.  An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..

[10]  Michael Langberg,et al.  The RPR2 rounding technique for semidefinite programs , 2001, J. Algorithms.

[11]  David P. Williamson,et al.  Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming , 2001, STOC '01.

[12]  Uri Zwick,et al.  A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems , 2001, Random Struct. Algorithms.

[13]  Uri Zwick,et al.  Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems , 1999, STOC '99.

[14]  Gunnar Andersson,et al.  An Approximation Algorithm for Max p-Section , 1999, STACS.

[15]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[16]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[17]  Nipam H. Patel,et al.  Segmentation , 2009, Encyclopedia of Database Systems.

[18]  A. Shokoufandeh,et al.  Theoretical Aspects of Computer Science , 2002, Lecture Notes in Computer Science.

[19]  Yinyu Ye,et al.  A .699-Approximation Algorithm for Max-Bisection , 1999 .

[20]  Venkatesan Guruswami,et al.  The 2-catalog segmentation problem , 1999, SODA '99.

[21]  Thomas A. Feo,et al.  One-Half Approximation Algorithms for the k-Partition Problem , 1992, Oper. Res..