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

From MaRDI portal
Revision as of 13:45, 20 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    29 November 2016
    0 references

    Identifiers