Cut-sufficient directed 2-commodity multiflow topologies
From MaRDI portal
Cites work
- An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
- An O( n)-approximation algorithm for directed sparsest cut
- Coarse differentiation and multi-flows in planar graphs
- Combinatorial approaches to multiflow problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Cuts, trees and \(\ell_1\)-embeddings of graphs
- Directed nowhere dense classes of graphs
- Directed tree-width
- Directed tree-width examples
- Embedding k-Outerplanar Graphs into l1
- Embeddings of planar quasimetrics into directed _1 and polylogarithmic approximation for directed sparsest-cut
- Flow-cut gaps for integer and fractional multiflows
- Forbidden directed minors and Kelly-width
- Four-terminus flows
- scientific article; zbMATH DE number 7378361 (Why is no real title available?)
- Improved approximation for directed cut problems
- Matroids and multicommodity flows
- Multi-Commodity Network Flows
- Multicommodity flows in planar graphs
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- On constant multi-commodity flow-cut gaps for families of directed minor-free graphs
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
- On the geometry of graphs with a forbidden minor
- The directed grid theorem
- The directed subgraph homeomorphism problem
- The geometry of graphs and some of its algorithmic applications
- Tournament minors
- When do Gomory-Hu subtrees exist?
- When the cut condition is enough, a complete characterization for multiflow problems in series-parallel networks
This page was built for publication: Cut-sufficient directed 2-commodity multiflow topologies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019052)
