Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models

We present a method for solving the transshipment problem---also known as uncapacitated minimum cost flow---up to a multiplicative error of $ 1 + \varepsilon $ in undirected graphs with nonnegative...