16 citations · 40 across the 15 of their papers we have counts for
1 paper · 2 filters
Ruben Becker, Andreas Karrenbauer
We present a combinatorial method for the min-cost flow problem and prove that its expected running time is bounded by O~(m3/2). This matches the best known bounds, whic…