Deterministic Rounding of Dynamic Fractional Matchings

@inproceedings{Bhattacharya2021DeterministicRO,
  title={Deterministic Rounding of Dynamic Fractional Matchings},
  author={Sayan Bhattacharya and P{\'e}ter Kiss},
  booktitle={ICALP},
  year={2021}
}
We present a framework for deterministically rounding a dynamic fractional matching. Applying our framework in a black-box manner on top of existing fractional matching algorithms, we derive the following new results: (1) The first deterministic algorithm for maintaining a $(2-\delta)$-approximate maximum matching in a fully dynamic bipartite graph, in arbitrarily small polynomial update time. (2) The first deterministic algorithm for maintaining a $(1+\delta)$-approximate maximum matching in a… 
Deterministic Dynamic Matching in Worst-Case Update Time
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)1 respectively. The
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 shows how to use dynamic bipartite matching algorithms as black-box subroutines for dynamic matching in general graphs without incurring the natural 2 factor in the approximation ratio which such approaches naturally incur.
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates
TLDR
This paper settles the complexity of dynamic packing and covering LPs, up to a polylogarithmic factor in update time, and initiates a systematic study of the multiplicative weights update (MWU) method in the dynamic setting.
Dynamic Algorithms for Maximum Matching Size
TLDR
This paper shows that when the goal is to maintain just the size of the matching instead of its edge-set, then these bounds can indeed be improved.
Decremental Matching in General Graphs
TLDR
This paper bridges the gap between bipartite and general graphs, by giving an O ε (poly(log n )) update time algorithm that maintains a (1 + ε )-approximate maximum integral matching under adversarial deletions.
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS
TLDR
A new approach to designing fully dynamic approximate matching algorithms that in a unified manner recovers all previously known trade-offs that were achieved via very different techniques, but reveals some new ones as well.
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds
TLDR
This work simplifies the approach of Bernstein and Stein for bipartite graphs, which allows it to generalize it for general graphs while maintaining the same bound of O (m ) on the worst-case update time.
On Regularity Lemma and Barriers in Streaming and Dynamic Matching
TLDR
This work presents a new approach for matchings in dense graphs by building on Szemer´edi’s celebrated Regularity Lemma, and presents a randomized (1 − o (1))-approximation algorithm whose space can be upper bounded by the density of certain Ruzsa-Szemer'edi (RS) graphs.
Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary
TLDR
This paper completely closes the gap with respect to recourse by showing algorithms against an adaptive adversary with near-optimal size-stretch trade-off and recourse and shows another algorithm that maintains a 3-spanner of size O ( n 1 . 5 ) with polylog( n ) amortized recourse and simultaneously O ( √ n ) worst-case update time.
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
TLDR
The key new idea is to invoke the recent sublinear-time matching algorithm of Behnezhad in a white-box manner to simulate the second pass of the streaming algorithms, while bypassing the well-known vertex-update barrier.
...
...

References

SHOWING 1-10 OF 48 REFERENCES
New deterministic approximation algorithms for fully dynamic matching
TLDR
This work presents two deterministic dynamic algorithms for the maximum matching problem and is the first deterministic algorithm that can maintain an o(logn)-approximate maximum matching with polylogarithmic update time.
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
TLDR
This work presents a new deterministic fully dynamic algorithm that maintains a O( 1)-approximate minimum vertex cover and maximum fractional matching, with an amortized update time of O(1).
Simple deterministic algorithms for fully dynamic maximal matching
TLDR
This paper shows the first deterministic fully dynamic algorithm that outperforms the trivial one and provides a deterministic worst-case update time of O(√m), which maintains a matching which is in fact a 3/2-approximate maximum cardinality matching (MCM).
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds
TLDR
A randomized algorithm for maintaining an {almost-maximal} matching in fully dynamic graphs with polylogarithmic worst-case update time that holds deterministically, while the almost-maximality guarantee holds with high probability.
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.
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.
Fully Dynamic (1+ e)-Approximate Matchings
TLDR
The main result is a data structure that maintains a (1+ϵ) approximation of maximum matching under edge insertions/deletions in worst case Õ(√mϵ-2) time per update, which improves the 3/2 approximation given by Neiman and Solomon [20] which runs in similar time.
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
TLDR
The main result is a randomized fully-dynamic $(2+\epsilon)$-approximate integral matching algorithm with small polylog worst- case update time that is the first algorithm that maintains approximate matchings with worst-case update time better than polynomial, for any constant approximation ratio.
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.
Fully Dynamic Maximal Matching in O (log n) Update Time
TLDR
This is the first polylog update time for maximal matching that implies an exponential improvement from the previous results and can maintain a factor two approximate maximum matching in $O(\log n )$ expected amortized time per update as a direct corollary of the maximal matching scheme.
...
...