Finding minimum-cost flows by double scaling (Q1184348): Difference between revisions

@@ Property / cites work @@
+A Fast and Simple Algorithm for the Maximum Flow Problem
+Normal rank
@@ Property / cites work @@
+Improved Time Bounds for the Maximum Flow Problem
@@ Property / cites work: Improved Time Bounds for the Maximum Flow Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5624995
@@ Property / cites work: Q5624995 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Scaling algorithms for network problems
@@ Property / cites work: Scaling algorithms for network problems / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Scaling Algorithms for Network Problems
@@ Property / cites work: Faster Scaling Algorithms for Network Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Minimum-Cost Circulations by Successive Approximation
+Normal rank
@@ Property / cites work @@
+Finding minimum-cost circulations by canceling negative cycles
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+On the simplex algorithm for networks and generalized networks
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Self-adjusting binary search trees
@@ Property / cites work: Self-adjusting binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+A strongly polynomial minimum cost circulation algorithm
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
+Normal rank
@@ Property / cites work @@
+On a Class of Capacitated Transportation Problems
@@ Property / cites work: On a Class of Capacitated Transportation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A bad network problem for the simplex method and other minimum cost flow algorithms
+Normal rank