scientific article; zbMATH DE number 3906192

MaRDI QIDQ3683847zbMATH OpenFDO

Authors Alexander V. Karzanov

Publication date 1984

zbMATH Keywords

cut packinggeneralized MFMC-propertymulticommodity cut problemsmulticommodity flow problems

Mathematics Subject Classification ID

Graph theory (05C99) Deterministic network models in operations research (90B10) Integer programming (90C10)

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)

• Families of cuts with the MFMC-property
• Distances and cuts in planar graphs
• Short proofs on multicommodity flows and cuts
• How to tidy up a symmetric set-system by use of uncrossing operations
• Packings of cuts realizing distances between certain vertices in a planar graph

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)