Skip to main content
SpringerLink
Log in

Optimization via enumeration: a new algorithm for the Max Cut Problem

  • Published:
Mathematical Programming Submit manuscript

Abstract.

We present a polynomial time algorithm to find the maximum weight of an edge-cut in graphs embeddable on an arbitrary orientable surface, with integral weights bounded in the absolute value by a polynomial of the size of the graph.</

The algorithm has been implemented for toroidal grids using modular arithmetics and the generalized nested dissection method. The applications in statistical physics are discussed.

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

Access this article

Log in via an institution

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. Istituto di Analisi dei Sistemi ed Informatica – CNR, viale Manzoni 30, 00185 Roma, Italy, email: galluccio@iasi.rm.cnr.it, , , , , , IT

    Anna Galluccio

  2. Department of Applied Mathematics, Charles University, Malostránske nám. 25, 11800 Praha, Czech Republic, email: {loebl,vondrak}@kam.ms.mff.cuni.cz, , , , , , CZ

    Martin Loebl & Jan Vondrák

Authors
  1. Anna Galluccio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Loebl
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan Vondrák
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: June 1999 / Accepted: December 2000¶Published online March 22, 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Galluccio, A., Loebl, M. & Vondrák, J. Optimization via enumeration: a new algorithm for the Max Cut Problem. Math. Program. 90, 273–290 (2001). https://doi.org/10.1007/PL00011425

Download citation

  • Issue Date:

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

Search

Navigation