论文信息 - An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems - 字舞流文

An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems

D. Du | Dachuan Xu | Chenchen Wu

[1] Weili Wu,et al. Better approximation algorithms for influence maximization in online social networks , 2015, J. Comb. Optim..

[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] Aditya Bhaskara,et al. Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph , 2011, SODA.

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

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

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

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

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

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

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