Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds

11/18/2017
by   Moses Charikar, et al.
0

Despite significant research efforts, the state-of-the-art algorithm for maintaining an approximate matching in fully dynamic graphs has a polynomial worst-case update time, even for very poor approximation guarantees. In a recent breakthrough, Bhattacharya, Henzinger and Nanongkai showed how to maintain a constant approximation to the minimum vertex cover, and thus also a constant-factor estimate of the maximum matching size, with polylogarithmic worst-case update time. Later (in SODA'17 Proc.) they improved the approximation factor all the way to 2+. Nevertheless, the longstanding fundamental problem of maintaining an approximate matching with sub-polynomial worst-case time bounds remained open. In this work we present a randomized algorithm for maintaining an almost-maximal matching in fully dynamic graphs with polylogarithmic worst-case update time. Such a matching provides (2+)-approximations for both the maximum matching and the minimum vertex cover, for any > 0. Our result was done independently of the SODA'17 (2+)-approximation result of Bhattacharya et al., so it provides the first (2+)-approximation for minimum vertex cover (together with Bhattacharya et al.'s result) and the first (2+)-approximation for maximum (integral) matching. The worst-case update time of our algorithm, namely O(( n,^-1)), holds deterministically, while the almost-maximality guarantee holds with high probability. Moreover, this guarantee also bounds the number of changes (replacements) to our matching in the worst-case. This result not only settles the aforementioned problem on dynamic matchings, but also provides essentially the best possible (under the unique games conjecture) approximation guarantee for dynamic vertex cover.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2018

A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching

Many dynamic graph algorithms have an amortized update time, rather than...
research
05/14/2021

Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach

In the (fully) dynamic set cover problem, we have a collection of m sets...
research
11/17/2017

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms

We present a simple randomized reduction from fully-dynamic integral mat...
research
07/12/2019

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Given a source of iid samples of edges of an input graph G with n vertic...
research
11/23/2022

Worst-Case to Expander-Case Reductions

In recent years, the expander decomposition method was used to develop m...
research
07/10/2019

Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing

With few exceptions (namely, algorithms for maximal matching, 2-approxim...
research
05/09/2018

Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε^2) Amortized Update Time

We consider the problem of maintaining an (approximately) minimum vertex...

Please sign up or login with your details

Forgot password? Click here to reset