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

From MaRDI portal
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
    0 references
    25 January 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references