Improved Approximation Algorithms for Maximum Graph Partitioning Problems

We consider the design of approximation algorithms for a number of maximum graph partitioning problems, among others MAX-k-CUT, MAX-k-DENSE-SUBGRAPH, and MAX-k-DIRECTED-UNCUT. We present a new version of the semidefnite relaxation scheme along with a better analysis, extending work of Halperin and Zwick (2002). This leads to an improvement over known approximation factors for such problems. The key to the improvement is the following new technique: It was already observed by Han et al. (2002) that a parameter-driven choice of the random hyperplane can lead to better approximation factors than obtained by Goemans and Williamson (1995). But it remained difficult to find a “good” set of parameters. In this paper, we analyze random hyperplanes depending on several new parameters. We prove that a sub-optimal choice of these parameters can be obtained by the solution of a linear program which leads to the desired improvement of the approximation factors. In this fashion a more systematic analysis of the semidefinite relaxation scheme is obtained.

[1]  Y. Ye,et al.  Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics , 1998 .

[2]  Refael Hassin,et al.  A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts , 2001, SIAM J. Discret. Math..

[3]  Alan M. Frieze,et al.  Improved approximation algorithms for MAXk-CUT and MAX BISECTION , 1995, Algorithmica.

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

[5]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[6]  Maxim Sviridenko,et al.  Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts , 1999, IPCO.

[7]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[8]  Jiawei Zhang,et al.  Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection , 2003, J. Glob. Optim..

[9]  Anand Srivastav,et al.  Finding Dense Subgraphs with Semidefinite Programming , 1998, APPROX.

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

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

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

[13]  Michael Langberg,et al.  Approximation Algorithms for Maximization Problems Arising in Graph Partitioning , 2001, J. Algorithms.

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

[15]  U. Feige,et al.  On the densest k-subgraph problems , 1997 .

[16]  Hisao Tamaki,et al.  Greedily Finding a Dense Subgraph , 2000, J. Algorithms.

[17]  Sanjeev Mahajan,et al.  Derandomizing Approximation Algorithms Based on Semidefinite Programming , 1999, SIAM J. Comput..

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