We provide algorithms with improved pass and space complexities for approximately solving linear programs, optimal transport, bipartite matching, and more in the semi-streaming model. For instance, we provide a (randomized)algorithm computing a maximum cardinality matching in an unweighted bipartite graph in O(\log^2 n \cdot \epsilon ^{-1} ) passes, using O(n \log^2 n \cdot \epsilon^{-1)auxiliary memory.
<clarity> We provide algorithms with improved pass and space complexities for approximately solving linear programs, optimal transport, bipartite matching, and more in the semi-streaming model. For instance, we provide a (randomized)algorithm computing a maximum cardinality matching in an unweighted bipartite graph in O(\log^2 n \cdot \epsilon ^{-1} ) passes, using O(n \log^2 n \cdot \epsilon^{-1)auxiliary memory.
We provide (\epsilon ^{-1} ) passes, using O(n \log^2 n \cdot \epsilon^{-1)auxiliary memory.