An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Outward rotations / rank | |||
Normal rank | |||
Revision as of 01:43, 28 February 2024
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
