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… Expand
Fine-Grained Algorithm Design for Matching
Faster Fully Dynamic Matchings with Small Approximation Ratios
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs
  • J. V. D. Brand, Y. Lee, +5 authors Di Wang
  • Computer Science, Mathematics
  • 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
  • 2020
A Simpler Scaling Algorithm for Weighted Matching in General Graphs
  • Ran Duan
  • Mathematics, Computer Science
  • ArXiv
  • 2014
Fully Dynamic Matching in Bipartite Graphs
Beating the Folklore Algorithm for Dynamic Matching
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 12 REFERENCES
A scaling algorithm for weighted matching on general graphs
  • H. Gabow
  • Mathematics, Computer Science
  • 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985
Improved Linear Time Approximation Algorithms for Weighted Matchings
Sorting in Linear Time
PARTY - A Software Library for Graph Partitioning
High speed switch scheduling for local area networks
Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms
The problem of classification of personnel
Multiplying matrices faster than coppersmith-winograd
Two greedy heuristics for the weighted matching problems
  • Proceedings of the 9th Southeast Conference on Combinatorics, Graph Theory, and Computing (CongrNumer XXI). 65–76.
  • 1978
Implementation of algorithms for maximum matching on nonbipartite graphs.
...
1
2
...