This paper presents a simple and efficient semi-streaming algorithm that can (1-ε)-approximate the maximum (weighted) matching in a graph using O(log(n)/ε) passes and O(n log(n)/ε) bits of space.
