An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-015-9880-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002849997 / rank | |||
Normal rank | |||
Revision as of 19:53, 19 March 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
