Approximation algorithms for requirement cut on graphs (Q848961)

From MaRDI portal
Revision as of 14:41, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Approximation algorithms for requirement cut on graphs
scientific article

    Statements

    Approximation algorithms for requirement cut on graphs (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2010
    0 references
    graph partitioning
    0 references
    cut problems
    0 references
    approximation algorithms
    0 references

    Identifiers