MAX-CUT has a randomized approximation scheme in dense graphs (Q4885224)

From MaRDI portal
scientific article; zbMATH DE number 903458
Language Label Description Also known as
English
MAX-CUT has a randomized approximation scheme in dense graphs
scientific article; zbMATH DE number 903458

    Statements

    24 October 1996
    0 references
    cut in a graph
    0 references
    maximum cut problem
    0 references
    randomized algorithm
    0 references
    polynomial time
    0 references
    MAX-CUT has a randomized approximation scheme in dense graphs (English)
    0 references

    Identifiers