Direct product multicommodity max-concurrent-flow min-sparse-cut theorem
From MaRDI portal
Cites work
- A framework for solving VLSI graph layout problems
- An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
- Euclidean distortion and the sparsest cut (extended abstract)
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Flow-Cut Gaps and Face Covers in Planar Graphs
- Flow-cut gaps for integer and fractional multiflows
- Improved bounds on the max-flow min-cut ratio for multicommodity flows
- 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 the hardness of approximating Multicut and Sparsest-Cut
- Product Multicommodity Flow in Wireless Networks
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- Sparsest cut on bounded treewidth graphs: algorithms and hardness results
- Sparsest cuts and bottlenecks in graphs
- The unique games conjecture, integrality gap for cut problems and embeddability of negative-type metrics into _1
This page was built for publication: Direct product multicommodity max-concurrent-flow min-sparse-cut theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7291644)
