An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Chen-Chen Wu / rank | |||
| Property / author | |||
| Property / author: Dong-lei Du / rank | |||
| Property / author | |||
| Property / author: Da-Chuan Xu / rank | |||
Revision as of 20:21, 19 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems |
scientific article |
Statements
An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (English)
0 references
10 July 2015
0 references
semidefinite programming hierarchies
0 references
approximation algorithm
0 references
rounding
0 references
graph bisection problems
0 references
