A -Approximation for Maximum Weight Matching in the Semi-Streaming Model
Abstract: We present a simple deterministic single-pass -approximation algorithm for the maximum weight matching problem in the semi-streaming model. This improves upon the currently best known approximation ratio of . Our algorithm uses bits of space for constant values of . It relies on a variation of the local-ratio theorem, which may be of use for other algorithms in the semi-streaming model as well.
Paper Prompts
Sign up for free to create and run prompts on this paper.