Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
2021
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...
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
29
References
0
Citations
NaN
KQI