3 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2016
An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions
Ruben Becker, Andreas Karrenbauer, Kurt Mehlhorn
We present an interior point method for the min-cost flow problem that uses arc contractions and deletions to steer clear from the boundary of the polytope when path-following meth…
cs.DS2013★ 3 cited
A Combinatorial -time Algorithm for the Min-Cost Flow Problem
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 . This matches the best known bounds, whic…