A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_28 ◽

2014 ◽

pp. 324-335 ◽

Author(s):

Chenchen Wu ◽

Dachuan Xu ◽

Donglei Du ◽

Wen-qing Xu

Keyword(s):

Approximation Algorithm ◽

Semidefinite Programming ◽

Complex Semidefinite Programming

Download Full-text

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

Journal of Combinatorial Optimization ◽

10.1007/s10878-015-9880-z ◽

2015 ◽

Vol 32 (4) ◽

pp. 1017-1035 ◽

Author(s):

Chenchen Wu ◽

Dachuan Xu ◽

Donglei Du ◽

Wenqing Xu

Keyword(s):

Approximation Algorithm ◽

Semidefinite Programming ◽

Complex Semidefinite Programming

Download Full-text

Erratum: A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-08783-2_60 ◽

2014 ◽

pp. E1-E1

Author(s):

Chenchen Wu ◽

Dachuan Xu ◽

Donglei Du ◽

Wen-qing Xu

Keyword(s):

Approximation Algorithm ◽

Semidefinite Programming ◽

Complex Semidefinite Programming

Download Full-text

Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-02026-1_20 ◽

2009 ◽

pp. 219-230 ◽

Author(s):

Ai-fan Ling

Keyword(s):

Approximation Algorithms ◽

Semidefinite Programming ◽

Semidefinite Programming Relaxation ◽

Complex Semidefinite Programming

Download Full-text

An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-642-38768-5_28 ◽

2013 ◽

pp. 304-315 ◽

Author(s):

Chenchen Wu ◽

Donglei Du ◽

Dachuan Xu

Keyword(s):

Approximation Algorithm ◽

Semidefinite Programming ◽

Graph Bisection

Download Full-text

Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2003.07.012 ◽

2004 ◽

Vol 68 (2) ◽

pp. 442-470 ◽

Author(s):

Michel X. Goemans ◽

David P. Williamson

Keyword(s):

Approximation Algorithms ◽

Semidefinite Programming ◽

Complex Semidefinite Programming

Download Full-text

A Parallel Approximation Algorithm for Positive Semidefinite Programming

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2011.25 ◽

2011 ◽

Author(s):

Rahul Jain ◽

Penghui Yao

Keyword(s):

Approximation Algorithm ◽

Semidefinite Programming ◽

Positive Semidefinite ◽

Parallel Approximation ◽

Parallel Approximation Algorithm

Download Full-text

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

Journal of Combinatorial Optimization ◽

10.1007/s10878-013-9673-1 ◽

2013 ◽

Vol 29 (1) ◽

pp. 53-66 ◽

Author(s):

Chenchen Wu ◽

Donglei Du ◽

Dachuan Xu

Keyword(s):

Approximation Algorithm ◽

Semidefinite Programming ◽

Graph Bisection

Download Full-text

Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming

Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01 ◽

10.1145/380752.380838 ◽

2001 ◽

Author(s):

Michel X. Goemans ◽

David Williamson

Keyword(s):

Approximation Algorithms ◽

Semidefinite Programming ◽

Complex Semidefinite Programming

Download Full-text

An improved approximation algorithm for the $2$-catalog segmentation problem using semidefinite programming relaxation

Journal of Industrial & Management Optimization ◽

10.3934/jimo.2012.8.117 ◽

2012 ◽

Vol 8 (1) ◽

pp. 117-126

Author(s):

Chenchen Wu ◽

◽

Dachuan Xu ◽

Xin-Yuan Zhao ◽

Keyword(s):

Approximation Algorithm ◽

Semidefinite Programming ◽

Semidefinite Programming Relaxation ◽

Segmentation Problem

Download Full-text

Using Complex Semidefinite Programming for Approximating MAX E2-LIN3

Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/3-540-44666-4_1 ◽

2001 ◽

pp. 1-1

Author(s):

Michel X. Goemans

Keyword(s):

Semidefinite Programming ◽

Complex Semidefinite Programming

Download Full-text