A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems (Q4537628)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems |
scientific article; zbMATH DE number 1762018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems |
scientific article; zbMATH DE number 1762018 |
Statements
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems (English)
0 references
1 July 2002
0 references
semidefinite programming
0 references
MAX CUT algorithm
0 references
0.994304358959198
0 references
0.8981106281280518
0 references
0.8935962319374084
0 references
0.8932613730430603
0 references
