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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding |
scientific article |
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
