Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: SDPLR / rank | |||
Normal rank |
Revision as of 01:26, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems |
scientific article |
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