Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558)

From MaRDI portal
Revision as of 19:55, 31 August 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
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
scientific article

    Statements

    Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (English)
    0 references
    25 January 2005
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references