An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074)

From MaRDI portal
Revision as of 11:44, 2 September 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 max<i>k</i>-uncut with capacity constraints
scientific article

    Statements

    An approximation algorithm for max<i>k</i>-uncut with capacity constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    Max \(k\)-uncut
    0 references
    capacity constraints
    0 references
    local search
    0 references
    unbalanced partition
    0 references