66 research outputs found
A Simple -Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
We present a simple semi-streaming algorithm for -approximation
of bipartite matching in passes. This matches the
performance of state-of-the-art "-efficient" algorithms, while being
considerably simpler.
The algorithm relies on a "white-box" application of the multiplicative
weight update method with a self-contained primal-dual analysis that can be of
independent interest. To show case this, we use the same ideas, alongside
standard tools from matching theory, to present an equally simple
semi-streaming algorithm for -approximation of weighted matchings
in general (not necessarily bipartite) graphs, again in
passes
- …