Deterministic Dynamic Matching In Worst-Case Update Time

08/24/2021
by   Peter Kiss, et al.
0

We present deterministic algorithms for maintaining a (3/2 + ϵ) and (2 + ϵ)-approximate maximum matching in a fully dynamic graph with worst-case update times Ô(√(n)) and Õ(1) respectively. The fastest known deterministic worst-case update time algorithms for achieving approximation ratio (2 - δ) (for any δ > 0) and (2 + ϵ) were both shown by Roghani et al. [2021] with update times O(n^3/4) and O_ϵ(√(n)) respectively. We close the gap between worst-case and amortized algorithms for the two approximation ratios as the best deterministic amortized update times for the problem are O_ϵ(√(n)) and Õ(1) which were shown in Bernstein and Stein [SODA'2021] and Bhattacharya and Kiss [ICALP'2021] respectively. In order to achieve both results we explicitly state a method implicitly used in Nanongkai and Saranurak [STOC'2017] and Bernstein et al. [arXiv'2020] which allows to transform dynamic algorithms capable of processing the input in batches to a dynamic algorithms with worst-case update time. Independent Work: Independently and concurrently to our work Grandoni et al. [arXiv'2022] has presented a fully dynamic algorithm for maintaining a (3/2 + ϵ)-approximate maximum matching with deterministic worst-case update time O_ϵ(√(n)).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2021

Beating the Folklore Algorithm for Dynamic Matching

The maximum matching problem in dynamic graphs subject to edge updates (...
research
03/15/2018

Dynamic Approximate Matchings with an Optimal Recourse Bound

In the area of dynamic matching algorithms, the number of changes to the...
research
05/05/2020

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms

We introduce a notion for hierarchical graph clustering which we call th...
research
12/30/2017

Efficiently Enumerating all Maximal Cliques with Bit-Parallelism

The maximal clique enumeration (MCE) problem has numerous applications i...
research
05/04/2021

Deterministic Rounding of Dynamic Fractional Matchings

We present a framework for deterministically rounding a dynamic fraction...
research
05/01/2020

We Need to Talk About Random Splits

Gorman and Bedrick (2019) recently argued for using random splits rather...
research
11/05/2021

Fast Deterministic Fully Dynamic Distance Approximation

In this paper, we develop deterministic fully dynamic algorithms for com...

Please sign up or login with your details

Forgot password? Click here to reset