On the Max-flow min-cut ratio for directed multicommodity flows (Q818146): Difference between revisions

@@ Property / cites work @@
+Q4471352
@@ Property / cites work: Q4471352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471328
@@ Property / cites work: Q4471328 / rank @@
+Normal rank
@@ Property / cites work @@
+Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+A lower bound on the integrality gap for minimum multicut in directed networks
+Normal rank
@@ Property / cites work @@
+Q5501283
@@ Property / cites work: Q5501283 / rank @@
+Normal rank