# Linear-Time Approximation for Maximum Weight Matching

@article{Duan2014LinearTimeAF, title={Linear-Time Approximation for Maximum Weight Matching}, author={Ran Duan and Seth Pettie}, journal={J. ACM}, year={2014}, volume={61}, pages={1:1-1:23} }

The <i>maximum cardinality</i> and <i>maximum weight matching</i> problems can be solved in <i>Õ</i>(<i>m</i>√<i>n</i>) time, a bound that has resisted improvement despite decades of research. (Here <i>m</i> and <i>n</i> are the number of edges and vertices.) In this article, we demonstrate that this “<i>m</i>√<i>n</i> barrier” can be bypassed by approximation. For any <i>ε</i> > 0, we give an algorithm that computes a (1 − <i>ε</i>)-approximate maximum weight matching in <i>O</i>(<i>mε</i><sup…

## 208 Citations

### Fine-Grained Algorithm Design for Matching

- Computer ScienceArXiv
- 2016

The first linear-time algorithm for maximum matching on cocomparability graphs is developed, based on the recently discovered Lexicographic Depth First Search (LDFS), and a deeper and systematic study of various "distance to triviality"-parameters for the maximum matching problem is started.

### Faster Fully Dynamic Matchings with Small Approximation Ratios

- Computer Science, MathematicsSODA
- 2016

A fully dynamic deterministic algorithm that maintains a (3/2 + e)-approximation in amortized update time O(m1/4e--2.5) and manages to be polynomially faster than all existing deterministic algorithms, while still maintaining a better-than-2 approximation.

### Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs

- Computer Science2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
- 2020

A simple sublinear-time algorithm for detecting and sampling high-energy edges in electric flows on expanders and show that when combined with recent advances in dynamic expander decompositions, this yields efficient data structures for maintaining the iterates of both [v.d.Brand-Lee-Sidford-Song 2020] and the authors' new IPMs.

### A 2/3-approximation algorithm for vertex-weighted matching

- Computer ScienceDiscrete Applied Mathematics
- 2019

### The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs

- Computer ScienceESA
- 2017

Improved streaming algorithms for approximating the size of maximum matching with sparse (bounded arboricity) graphs and the first with an approximation guarantee independent of d are presented.

### Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach

- Mathematics, Computer ScienceSODA
- 2016

This paper maintains fully dynamic (1 + e)-approximate MCM with worst-case update time O(α ·e--2) for graphs with arboricity1 bounded by α, and provides local algorithms of independent interest for maintaining fully dynamic approximate matching and vertex cover.

### A Simpler Scaling Algorithm for Weighted Matching in General Graphs

- Computer ScienceArXiv
- 2014

We present a new scaling approach for the maximum weight perfect matching problem in general graphs, with running time O((m + n log n) √ n log(nN)), where n,m,N denote the number of vertices, number…

### Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time

- Computer ScienceFSTTCS
- 2014

It is shown that one can find matching sparsifier even in an incremental bipartite graph in O(log^2(n) / (epsilon^{4}) update time.

### Beating the Folklore Algorithm for Dynamic Matching

- Computer ScienceITCS
- 2022

This work presents the first deterministic algorithm which outperforms the folklore algorithm in terms of both approximation ratio and worst-case update time, and shows how to use dynamic bipartite matching algorithms as black-box subroutines for dynamic matching in general graphs without incurring the natural 2 factor in the approximation ratio which such approaches naturally incur.

### Approximation algorithms for bipartite matching with metric and geometric costs

- Computer ScienceSTOC
- 2014

This work considers the case when d(·,·) is a metric, and presents three approximation algorithms for computing minimum-cost perfect matchings in G, which lead to faster matching algorithms for many geometric settings.

## References

SHOWING 1-10 OF 113 REFERENCES

### A faster implementation of the Goemans-Williamson clustering algorithm

- Computer ScienceSODA '01
- 2001

We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Prize Collecting…

### Deterministic sorting in O(nlog log n) time and linear space

- Computer ScienceSTOC '02
- 2002

A fast deterministic algorithm for integer sorting in linear space which sorts integers in the range of 0, 1, 2, &1dots;, <i>m</i>—1 inlinear space in time and linear space and uses randomization.

### A general approximation technique for constrained forest problems

- Computer ScienceSODA '92
- 1992

The first approximation algorithms for many NP-complete problems, including the non-fixed point-to-point connection problem, the exact path partitioning problem and complex location-design problems are derived.

### Approximating Maximum Weight Matching in Near-Linear Time

- Computer Science2010 IEEE 51st Annual Symposium on Foundations of Computer Science
- 2010

This paper presents the first near-linear time algorithm for computing $(1-\epsilon)$-approximate MWMs, and presents a faster algorithm, running in $O(m\log n\log\ep silon^{-1})$ time, that computes a $(3/4-\Epsilon]$- approximate MWM.

### Fibonacci heaps and their uses in improved network optimization algorithms

- PhysicsJACM
- 1987

Using F-heaps, a new data structure for implementing heaps that extends the binomial queues proposed by Vuillemin and studied further by Brown, the improved bound for minimum spanning trees is the most striking.

### Maximum matchings via Gaussian elimination

- Computer Science45th Annual IEEE Symposium on Foundations of Computer Science
- 2004

The results resolve a long-standing open question of whether Lovasz's randomized technique of testing graphs for perfect matching in time O(n/sup w/) can be extended to an algorithm that actually constructs a perfect matching.

### A simple reduction from maximum weight matching to maximum cardinality matching

- MathematicsInf. Process. Lett.
- 2012

### Efficient algorithms for maximum weight matchings in general graphs with small edge weights

- Computer Science, MathematicsSODA
- 2012

This work presents a simple iterative algorithm that uses a maximum cardinality matching algorithm as a subroutine to solve the maximum weight matching problem in O(W √nm logn(n2/m) time, or in O (Wnω) time with high probability.

### A Decomposition Theorem for Maximum Weight Bipartite Matchings

- MathematicsSIAM J. Comput.
- 2001

A new decomposition theorem is presented for maximum weight bipartite matchings and the weight of a maximum weight matching of G - {u} for all nodes u in O(W) time is computed.

### A scaling algorithm for weighted matching on general graphs

- Computer Science26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
- 1985

An algorithm for maximum matching on general graphs with integral edge weights, running in time O(n3/4m lg N), where n, m and N are the number of vertices, number of edges, and largest edge weight magnitude, respectively.