An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C22 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6657312 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complex semidefinite programming | |||
Property / zbMATH Keywords: complex semidefinite programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
approximation algorithm | |||
Property / zbMATH Keywords: approximation algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
balanced Max-3-Uncut | |||
Property / zbMATH Keywords: balanced Max-3-Uncut / rank | |||
Normal rank |
Revision as of 07:24, 28 June 2023
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