Work

Improved inapproximability of Max-Cut through Min-Cut

Year: 2018

Type: dissertation

Abstract: A cut is a partition of a graph's nodes into two sets, and we say that an edge crosses the cut if it connects two nodes belonging to different sets. A maximum cut is a cut that maximises the number of crossing edges. We show that for any sufficiently small ε > 0 it is NP-hard to distinguish between graphs for which at least a fraction 1 - ε of all edges crosses the maximum cut and graphs for which at most a fraction 1 - 1.4568 ε of all edges crosses the maximum cut. The previous state of the art had a constant smaller than 1.375 in place of 1.4568.

Source: KTH Publication Database DiVA (KTH Royal Institute of Technology)

Author: Mårten Wiman

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2942946217

Cites:

Cited by:

Related to: 10