An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478)

From MaRDI portal
Revision as of 01:43, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding
scientific article

    Statements

    An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (English)
    0 references
    29 November 2016
    0 references
    complex semidefinite programming
    0 references
    approximation algorithm
    0 references
    balanced Max-3-Uncut
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers