Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189): Difference between revisions

@@ Property / cites work @@
+Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
+Normal rank
@@ Property / cites work @@
+Approximating minimum feedback sets and multicuts in directed graphs
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate max-flow min-(multi)cut theorems and their applications
+Normal rank
@@ Property / cites work @@
+Excluded minors, network decomposition, and multicommodity flow
+Normal rank
@@ Property / cites work @@
+An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
+Normal rank
@@ Property / cites work @@
+Multicommodity flows in planar graphs
@@ Property / cites work: Multicommodity flows in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matroids and multicommodity flows
@@ Property / cites work: Matroids and multicommodity flows / rank @@
+Normal rank
@@ Property / cites work @@
+Packing directed circuits fractionally
@@ Property / cites work: Packing directed circuits fractionally / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximations for the minimum-cut ratio and the flux
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01299746
+Normal rank
@@ Property / OpenAlex ID @@
+W2610755752
@@ Property / OpenAlex ID: W2610755752 / rank @@
+Normal rank