Minimum-cost flows in unit-capacity networks (Q1693987): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-017-9776-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2614327298
@@ Property / OpenAlex ID: W2614327298 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum-cost flows by double scaling
@@ Property / cites work: Finding minimum-cost flows by double scaling / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Global Price Updates Help
@@ Property / cites work: Global Price Updates Help / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational behavior of a polynomial-time network flow algorithm
+Normal rank
@@ Property / cites work @@
+Buckets, Heaps, Lists, and Monotone Priority Queues
+Normal rank
@@ Property / cites work @@
+Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Q3549731
@@ Property / cites work: Q3549731 / rank @@
+Normal rank
@@ Property / cites work @@
+Network Flow and Testing Graph Connectivity
@@ Property / cites work: Network Flow and Testing Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+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 @@
+Scaling Algorithms for the Shortest Paths Problem
@@ Property / cites work: Scaling Algorithms for the Shortest Paths Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Minimum-Cost Circulations by Successive Approximation
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Strongly Polynomial Minimum Cost Flow Algorithm
+Normal rank
@@ Property / cites work @@
+Q3908745
@@ Property / cites work: Q3908745 / rank @@
+Normal rank
@@ Property / cites work @@
+A strongly polynomial minimum cost circulation algorithm
+Normal rank