An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294): 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-013-9673-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086871104 / rank | |||
Normal rank | |||
Revision as of 19:35, 19 March 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
