Log In Sign Up

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time

by   Sayan Bhattacharya, et al.

We present dynamic algorithms with polylogarithmic update time for estimating the size of the maximum matching of a graph undergoing edge insertions and deletions with approximation ratio strictly better than 2. Specifically, we obtain a 1+1/√(2)+ϵ≈ 1.707+ϵ approximation in bipartite graphs and a 1.973+ϵ approximation in general graphs. We thus answer in the affirmative the major open question first posed in the influential work of Onak and Rubinfeld (STOC'10) and repeatedly asked in the dynamic graph algorithms literature. Our randomized algorithms also work against an adaptive adversary and guarantee worst-case polylog update time, both w.h.p. Our algorithms are based on simulating new two-pass streaming matching algorithms in the dynamic setting. Our key new idea is to invoke the recent sublinear-time matching algorithm of Behnezhad (FOCS'21) in a white-box manner to efficiently simulate the second pass of our streaming algorithms, while bypassing the well-known vertex-update barrier.


page 1

page 2

page 3

page 4


Fully Dynamic Matching: Beating 2-Approximation in Δ^ε Update Time

In fully dynamic graphs, we know how to maintain a 2-approximation of ma...

On Regularity Lemma and Barriers in Streaming and Dynamic Matching

We present a new approach for finding matchings in dense graphs by build...

Optimal Streaming Algorithms for Graph Matching

We present parameterized streaming algorithms for the graph matching pro...

Rounding Dynamic Matchings Against an Adaptive Adversary

We present a new dynamic matching sparsification scheme. From this schem...

New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS

We study the maximum matching problem in fully dynamic graphs: a graph i...

Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching

Box-simplex games are a family of bilinear minimax objectives which enca...

Maximum Matching sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model

The problem of finding a maximum size matching in a graph (known as the ...