Approximation algorithms for requirement cut on graphs (Q848961)

From MaRDI portal
Revision as of 08:19, 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
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