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

From MaRDI portal
Revision as of 01:53, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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