16 citations · 40 across the 15 of their papers we have counts for
Showing 2016Show 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.DS2016★ 16 cited
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
Ruben Becker, Sebastian Forster, Andreas Karrenbauer +1
We present a method for solving the transshipment problem - also known as uncapacitated minimum cost flow - up to a multiplicative error of in undirected graphs w…