Improved approximation of Max-Cut on graphs of bounded degree (Q3150283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1809789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation of Max-Cut on graphs of bounded degree |
scientific article; zbMATH DE number 1809789 |
Statements
Improved approximation of Max-Cut on graphs of bounded degree (English)
0 references
30 September 2002
0 references
Max-Cut problem
0 references
random hyperplane rounding technique
0 references
semidefinite relaxation
0 references
0.9133315682411194
0 references
0.8792445659637451
0 references
0.8618713617324829
0 references
0.8550994992256165
0 references
