Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639)

From MaRDI portal
Revision as of 04:20, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems
scientific article

    Statements

    Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (English)
    0 references
    0 references
    0 references
    13 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    sparsest cut
    0 references
    graph partitioning
    0 references
    linear programming
    0 references
    clustering
    0 references
    0 references