A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163)

From MaRDI portal
Revision as of 20:55, 6 July 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
A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem
scientific article

    Statements

    A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (English)
    0 references
    0 references
    11 December 2015
    0 references
    unbalanced cut
    0 references
    Min \(s\)-\(t\) Cut
    0 references
    approximation algorithm
    0 references
    linear programming
    0 references
    network community
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references