Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224)
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: Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems |
scientific article; zbMATH DE number 6872132
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems |
scientific article; zbMATH DE number 6872132 |
Statements
Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (English)
0 references
24 May 2018
0 references
semidefinite programming
0 references
approximation algorithms
0 references
\textsc{MaxCut}
0 references
\textsc{Max2Sat}
0 references
\textsc{Max3Sat}
0 references
0 references
0 references
0 references
0 references
0 references
