Constructing worst case instances for semidefinite programming based approximation algorithms (Q2768278)
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: Constructing worst case instances for semidefinite programming based approximation algorithms |
scientific article; zbMATH DE number 1699209
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing worst case instances for semidefinite programming based approximation algorithms |
scientific article; zbMATH DE number 1699209 |
Statements
30 January 2002
0 references
semidefinite programming
0 references
MAX CUT problem
0 references
Constructing worst case instances for semidefinite programming based approximation algorithms (English)
0 references
