DeepAI AI Chat
Log In Sign Up

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

by   Moab Arar, et al.

We present a simple randomized reduction from fully-dynamic integral matching algorithms to fully-dynamic approximately-maximal" fractional matching algorithms. Applying this reduction to the recent fractional matching algorithm of Bhattacharya, Henzinger, and Nanongkai (SODA 2017), we obtain a novel result for the integral problem. Specifically, our main result is a randomized fully-dynamic (2+ϵ)-approximate integral matching algorithm with small polylog worst-case update time. For the (2+ϵ)-approximation regime only a fractional fully-dynamic (2+ϵ)-matching algorithm with worst-case polylog update time was previously known, due to Bhattacharya et al. (SODA 2017). Our algorithm is the first algorithm that maintains approximate matchings with worst-case update time better than polynomial, for any constant approximation ratio.


page 1

page 2

page 3

page 4


Beating the Folklore Algorithm for Dynamic Matching

The maximum matching problem in dynamic graphs subject to edge updates (...

Rounding Dynamic Matchings Against an Adaptive Adversary

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

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

Despite significant research efforts, the state-of-the-art algorithm for...

Distributed Half-Integral Matching and Beyond

By prior work, it is known that any distributed graph algorithm that fin...

Fully Dynamic Approximation of LIS in Polylogarithmic Time

We revisit the problem of maintaining the longest increasing subsequence...

Deterministic Rounding of Dynamic Fractional Matchings

We present a framework for deterministically rounding a dynamic fraction...

Stable fractional matchings

We study a generalization of the classical stable matching problem that ...