Short proofs on multicommodity flows and cuts

DOI10.1016/0095-8956(91)90052-LzbMath0760.05074MaRDI QIDQ1186123

Alexander Schrijver

Publication date: 28 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

multicommodity flowsconnected bipartite graphKarzanov's theorempacking of cuts

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

The parsimonious property of cut covering problems and its applications, A \(T_X\)-approach to some results on cuts and metrics, Metric packing for \(K_ 3 + K_ 3\), A Survey on Covering Supermodular Functions, Unnamed Item, Sums of cuts and bipartite metrics

Cites Work

• Unnamed Item
• Unnamed Item
• Half-integral five-terminus flows
• Combinatorial approaches to multiflow problems
• A short proof of the two-commodity flow theorem
• A two-commodity cut theorem
• Maximal Flow Through a Network
• Metrics and undirected cuts
• Four-terminus flows
• On some connectivity properties of Eulerian graphs
• On Two Commodity Network Flows
• Feasibility of Two Commodity Network Flows
• Multi-Commodity Network Flows