Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

The Goemans--Williamson randomized algorithm guarantees a high-quality approximation to the MAX-CUT problem, but the cost associated with such an approximation can be excessively high for large-scale problems due to the need for solving an expensive semidefinite relaxation. In order to achieve bette...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on optimization 2002, Vol.12 (2), p.503-521
Hauptverfasser:	Burer, Samuel, Monteiro, Renato D. C., Zhang, Yin
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied mathematics Approximation Grants Heuristic Optimization Variables
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!