Skip to main content
Springer Nature Link
Log in

A .699-approximation algorithm for Max-Bisection

  • Published:
Mathematical Programming Submit manuscript

Abstract.

We present a .699-approximation algorithm for Max-Bisection, i.e., partitioning the nodes of a weighted graph into two blocks of equal cardinality so as to maximize the weights of crossing edges. This is an improved result from the .651-approximation algorithm of Frieze and Jerrum and the semidefinite programming relaxation of Goemans and Williamson.

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

Author information

Authors and Affiliations

  1. Department of Management Sciences, Henry B. Tippie College of Business, The University of Iowa, Iowa City, Iowa 52242, USA., , , , , , US

    Yinyu Ye

Authors
  1. Yinyu Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: October 1999 / Accepted: July 2000¶Published online January 17, 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ye, Y. A .699-approximation algorithm for Max-Bisection. Math. Program. 90, 101–111 (2001). https://doi.org/10.1007/PL00011415

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00011415

Search

Navigation