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
TLDR
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. Expand
Faster Fully Dynamic Matchings with Small Approximation Ratios
TLDR
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. Expand
A 2/3-Approximation Algorithm for Vertex-weighted Matching
We consider the maximum vertex-weighted matching problem (MVM) for non-bipartite graphs. In earlier work we have described a 2/3-approximation algorithm for the MVM on bipartite graphs (Dobrian,Expand
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
TLDR
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. Expand
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs
TLDR
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. Expand
Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach
TLDR
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. Expand
A Simpler Scaling Algorithm for Weighted Matching in General Graphs
  • Ran Duan
  • Mathematics, Computer Science
  • ArXiv
  • 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, numberExpand
Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time
TLDR
It is shown that one can find matching sparsifier even in an incremental bipartite graph in O(log^2(n) / (epsilon^{4}) update time. Expand
Fully Dynamic Matching in Bipartite Graphs
TLDR
Two fully dynamic algorithms for maximum cardinality matching in bipartite graphs are presented, including a deterministic algorithm that maintains a \((3/2 + \epsilon )\) approximation in worst-case update time and a polynomially faster algorithm that is faster than all previous deterministic algorithms for any constant approximation. Expand
Beating the Folklore Algorithm for Dynamic Matching
TLDR
This work presents the first deterministic algorithm which outperforms the folklore algorithm in terms of both approximation ratio and worst-case update time, and gives a (2−Ω(1))-approximate algorithm with O( √ n 8 √ m) = O(n) worst- case update time in n-node, m-edge graphs. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 126 REFERENCES
A faster implementation of the Goemans-Williamson clustering algorithm
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 CollectingExpand
Deterministic sorting in O(nlog log n) time and linear space
  • Yijie Han
  • Mathematics, Computer Science
  • STOC '02
  • 2002
TLDR
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. Expand
A general approximation technique for constrained forest problems
TLDR
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. Expand
Approximating Maximum Weight Matching in Near-Linear Time
  • Ran Duan, Seth Pettie
  • Mathematics, Computer Science
  • 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • 2010
TLDR
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. Expand
Maximum matchings via Gaussian elimination
  • M. Mucha, P. Sankowski
  • Mathematics, Computer Science
  • 45th Annual IEEE Symposium on Foundations of Computer Science
  • 2004
TLDR
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. Expand
A simple reduction from maximum weight matching to maximum cardinality matching
  • Seth Pettie
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 2012
TLDR
A general reduction of the complexities of computing a maximum cardinality matching and a maximum weight matching for bipartite graphs leads to new bounds on the complexity of mwm on sparse graph classes, e.g., (bipartite) planar graphs, bounded genus graphs, and H-minor-free graphs. Expand
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
TLDR
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. Expand
A Decomposition Theorem for Maximum Weight Bipartite Matchings
TLDR
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. Expand
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
TLDR
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. Expand
Scaling algorithms for network problems
This paper gives algorithms for network problems that work by scaling the numeric parameters. Assume all parameters are integers. Let n, m, and N denote the number of vertices, number of edges, andExpand
...
1
2
3
4
5
...