Clustering Improves the Goemans–Williamson Approximation for the Max-Cut Problem

Clustering Improves the Goemans–Williamson Approximation for the Max-Cut Problem

MAXmathsizesmall-CUTmathsizesmall is one of the well-studied NP-hard combinatorial optimization problems. It can be formulated as an Integer Quadratic Programming problem and admits a simple relaxation obtained by replacing the integer “spin” variables <inline-formula><math display="in...

Full description

Bibliographic Details
Main Authors: Angel E. Rodriguez-Fernandez, Bernardo Gonzalez-Torres, Ricardo Menchaca-Mendez, and Peter F. Stadler
Format: Article
Language:English
Published: MDPI AG 2020-08-01
Series:Computation
Subjects:
algorithms
approximation
semidefinite programming
Max-Cut
clustering
Online Access:https://www.mdpi.com/2079-3197/8/3/75

Internet

https://www.mdpi.com/2079-3197/8/3/75

Similar Items