Near-Optimal Distributed Maximum Flow

@article{Ghaffari2015NearOptimalDM,
  title={Near-Optimal Distributed Maximum Flow},
  author={Mohsen Ghaffari and Andreas Karrenbauer and Fabian Kuhn and Christoph Lenzen and Boaz Patt-Shamir},
  journal={CoRR},
  year={2015},
  volume={abs/1508.04747}
}
We present a near-optimal distributed algorithm for (1 + o(1))-approximation of single-commodity maximum flow in undirected weighted networks that runs in (D + √ n) · n communication rounds in the CONGEST model. Here, n and D denote the number of nodes and the network diameter, respectively. This is the first improvement over the trivial bound of O(n), and it nearly matches the Ω̃(D + √ n) round complexity lower bound. The development of the algorithm contains two results of independent… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 32 references

A note on cutapproximators and approximating undirected max flows

  • S. A. Plotkin, D. B. Shmoys, É. Tardos
  • 2014

Similar Papers

Loading similar papers…