Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224)

From MaRDI portal
Revision as of 07:48, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    24 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    semidefinite programming
    0 references
    approximation algorithms
    0 references
    \textsc{MaxCut}
    0 references
    \textsc{Max2Sat}
    0 references
    \textsc{Max3Sat}
    0 references