Skip to main content

Advertisement

Springer Nature Link
Log in

Improved Approximation Algorithms for Maximum Graph Partitioning Problems

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • A. Ageev, R. Hassin, and M. Sviridenko, “A 0.5-approximation algorithm for MAX DICUT with given sizes of parts,” SIAM Journal on Discrete Mathematics, vol. 14, no. 2, pp. 246–255, 2001.

    Article  Google Scholar 

  • A. Ageev and M. Sviridenko, “Approximation algorithms for maximum coverage and max cut with given size of parts,” in Proceedings of Integer Programming and Combinatorial Optimization, 1999, pp. 17–30.

  • Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama, “Greedily finding a dense subgraph,” Journal of Algorithms, vol. 34, pp. 203–221, 2000.

    Article  Google Scholar 

  • D. Bertsimas and Y. Ye, Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics, Handbook of Combinatorial Optimization, vol. 3, Kluwer Academic Publishers, 1998, pp. 1–19.

  • A. Frieze and M. Jerrum, “Improved approximation algorithms for MAX k-CUT and MAX Bisection,” Algorithmica, vol. 18, pp. 67–81, 1997.

    Google Scholar 

  • U. Feige and M. Langberg, “Approximation algorithms for maximization problems arising in graph partitioning,” Journal of Algorithms, vol. 41, pp. 174–211, 2001.

    Article  Google Scholar 

  • U. Feige and M. Langberg, “The RPR2 rounding technique for semidefinite programs,” in Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, 2001, pp. 213–224.

  • U. Feige, G. Kortsarz, and D. Peleg, “The dense k-subgraph problem,” Algorithmica, vol. 29, pp. 410–421, 2001.

    Article  Google Scholar 

  • U. Feige and M. Seltser, “On the densest k-subgraph problem,” Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot, September 1997.

  • M.X. Goemans and D.P. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” Journal of the ACM, vol. 42, pp. 1115–1145, 1995.

    Article  Google Scholar 

  • E. Halperin and U. Zwick, “A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems,” Random Structures and Algorithms, vol. 20, no. 3, pp. 382–402, 2002.

    Article  Google Scholar 

  • Q. Han, Y. Ye, and J. Zhang, “An improved rounding method and semidefinite programming relaxation for graph partition,” Mathematical Programming, vol. 92, no. 3, pp. 509–535, 2002.

    Article  Google Scholar 

  • A. Srivastav and K. Wolf, “Finding dense subgraphs with semidefinite programming,” in Proceedings of Approximation Algorithms for Combinatorial Optimization, 1998, pp, 181–191.

  • A. Srivastav and K. Wolf, “Finding dense subgraphs with semidefinite programming,” Erratum, Mathematisches Seminar, Universität zu Kiel, 1999.

  • P. Turán, “On an extremal problem in graph theory,” Mat. Fiz. Lapok, vol. 48, pp. 436–452, 1941.

    Google Scholar 

  • Y. Ye, “A. 699-approximation algorithm for MAX-Bisection,” Mathematical Programming, vol. 90, no. 1, pp. 101–111, 2001.

    Google Scholar 

  • Y. Ye and J. Zhang, “Approximation of dense-n/2-subgraph and the complement of Min-Bisection,” Unpublished Manuscript, 1999.

Download references

Author information

Authors and Affiliations

  1. Christian-Albrechts-Universität Kiel, Mathematisches Seminar, Bereich 2, Christian-Albrechts-Platz 4, D-24118, Kiel, Germany

    Gerold Jäger & Anand Srivastav

Authors
  1. Gerold Jäger
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Anand Srivastav
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Gerold Jäger.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jäger, G., Srivastav, A. Improved Approximation Algorithms for Maximum Graph Partitioning Problems. J Comb Optim 10, 133–167 (2005). https://doi.org/10.1007/s10878-005-2269-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-005-2269-7

Keywords