Approximation algorithms for max cut and max bisection problems using semidefinite programming relaxations (Q5282656)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6747328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for max cut and max bisection problems using semidefinite programming relaxations |
scientific article; zbMATH DE number 6747328 |
Statements
14 July 2017
0 references
max cut problem
0 references
max bisection problem
0 references
approximation algorithm
0 references
semidefinite programming
0 references
0.883525013923645
0 references
0.8792257905006409
0 references
0.8728931546211243
0 references
0.8727554678916931
0 references
