scientific article; zbMATH DE number 3906192
From MaRDI portal
Publication:3683847
[For the entire collection see Zbl 0559.00001.] The paper establishes some relationships between the multicommodity cut problems and the multicommodity flow problems by introducing the concept of a generalized MFMC-property for abstract families of subsets of a set. Other results on cut packing problems are also discussed.
Recommendations
- Families of cuts with the MFMC-property
- scientific article; zbMATH DE number 508835
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- Combinatorial approaches to multiflow problems
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Cited in
(5)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683847)