Near-Optimal Distributed Maximum Flow

DOI10.1145/2767386.2767440zbMath1333.68273arXiv1508.04747OpenAlexW2116055396MaRDI QIDQ2796244

Christoph Lenzen, Mohsen Ghaffari, Fabian Kuhn, Andreas Karrenbauer, Boaz Patt-Shamir

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.04747

zbMATH Keywords

distributed computingmaximum flowgradient descentcongest modeldistributed congestion approximator

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Approximation algorithms (68W25) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (7)

Low-congestion shortcuts without embedding ⋮ Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts ⋮ Temporal flows in temporal networks ⋮ Unnamed Item ⋮ A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time ⋮ Near-Optimal Distributed Maximum Flow

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item

This page was built for publication: Near-Optimal Distributed Maximum Flow