Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224): 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.1016/j.disopt.2016.04.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2356944478 / rank | |||
Normal rank | |||
Revision as of 02:16, 20 March 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
