Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space [article]

Sepehr Assadi, Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian
2021 arXiv   pre-print
We provide O(ϵ^-1)-pass semi-streaming algorithms for computing (1-ϵ)-approximate maximum cardinality matchings in bipartite graphs. Our most efficient methods are deterministic and use optimal, O(n), space, improving upon the space complexity of the previous state-of-the-art O(ϵ^-1)-pass algorithm of Ahn and Guha. To obtain our results we provide semi-streaming adaptations of more general continuous optimization tools. Further, we leverage these techniques to obtain improvements for streaming
more » ... ariants of approximate linear programming, optimal transport, exact matching, transshipment, and shortest path problems.
arXiv:2011.03495v4 fatcat:tvmrf5dn3nhcfhu7kpnqppzwzu