Approximating Maximum Weight Matching in Near-Linear Time

Given a weighted graph, the maximum weight matching problem (MWM) is to find a set of vertex-disjoint edges with maximum weight. In the 1960s Edmonds showed that MWMs can be found in polynomial time. At present the fastest MWM algorithm, due to Gabow and Tarjan, runs in Õ(m√n) time, where m and n are the number of edges and vertices in the graph. Surprisingly, restricted versions of the problem, such as computing (1 - ϵ)-approximate MWMs or finding maximum cardinality matchings, are not known to be much easier (on sparse graphs). The best algorithms for these problems also run in Õ(m√n) time. In this paper we present the first near-linear time algorithm for computing (1 - e)-approximate MWMs. Specifically, given an arbitrary real-weighted graph and ϵ > 0, our algorithm computes such a matching in O(mϵ^-2 log³ n) time. The previous best approximate MWM algorithm with comparable running time could only guarantee a (2/3 - ϵ)-approximate solution. In addition, we present a faster algorithm, running in O(m log n log ϵ^-1) time, that computes a (3/4 - ϵ)-approximate MWM.