A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space
[article]
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
arXiv:2011.03495v4
fatcat:tvmrf5dn3nhcfhu7kpnqppzwzu