An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478)
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: An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding |
scientific article; zbMATH DE number 6657312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding |
scientific article; zbMATH DE number 6657312 |
Statements
An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (English)
0 references
29 November 2016
0 references
complex semidefinite programming
0 references
approximation algorithm
0 references
balanced Max-3-Uncut
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9483228325843812
0 references
0.8188705444335938
0 references
0.8131297826766968
0 references
0.8127460479736328
0 references
0.8127296566963196
0 references
