Flow-cut gaps for integer and fractional multiflows
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Flows in graphs (05C21) Structural characterization of families of graphs (05C75) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
- Flow-cut gaps for integer and fractional multiflows
- When the cut condition is enough, a complete characterization for multiflow problems in series-parallel networks
- Integer plane multiflow maximisation: flow-cut gap and one-quarter-approximation
- Max-multiflow/min-multicut for G+H series-parallel
- Integer plane multiflow maximisation: one-quarter-approximation and gaps
Cited in
(12)- Multiterminal flows and cuts
- Flow-cut gaps for integer and fractional multiflows
- Max-multiflow/min-multicut for G+H series-parallel
- Pathwidth, trees, and random embeddings
- Integer plane multiflow maximisation: flow-cut gap and one-quarter-approximation
- When do Gomory-Hu subtrees exist?
- Improved guarantees for vertex sparsification in planar graphs
- Improved guarantees for vertex sparsification in planar graphs
- On constant multi-commodity flow-cut gaps for families of directed minor-free graphs
- When the cut condition is enough, a complete characterization for multiflow problems in series-parallel networks
- A note on multiflows and treewidth
- Coarse differentiation and multi-flows in planar graphs
This page was built for publication: Flow-cut gaps for integer and fractional multiflows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417700)
