An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294)
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 improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems |
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
0 references
0 references
0 references
0 references
