New deterministic approximation algorithms for fully dynamic matching

DOI10.1145/2897518.2897568MaRDI QIDQ5361847zbMATH OpenOpenAlexFDO

Authors Sayan Bhattacharya, Danupon Nanongkai, Monika R. Henzinger

Publication date 29 September 2017

Published in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1604.05765

zbMATH Keywords

data structuresdynamic graph algorithms

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Abstract: We present two deterministic dynamic algorithms for the maximum matching problem. (1) An algorithm that maintains a $(2+epsilon)$-approximate maximum matching in general graphs with $O(extpoly(logn,1/epsilon))$ update time. (2) An algorithm that maintains an $alph{a}_K$ approximation of the {em value} of the maximum matching with $O(n^{2/K})$ update time in bipartite graphs, for every sufficiently large constant positive integer $K$. Here, $1leqalph{a}_K<2$ is a constant determined by the value of $K$. Result (1) is the first deterministic algorithm that can maintain an $o(logn)$-approximate maximum matching with polylogarithmic update time, improving the seminal result of Onak et al. [STOC 2010]. Its approximation guarantee almost matches the guarantee of the best {em randomized} polylogarithmic update time algorithm [Baswana et al. FOCS 2011]. Result (2) achieves a better-than-two approximation with {em arbitrarily small polynomial} update time on bipartite graphs. Previously the best update time for this problem was $O(m^{1/4})$ [Bernstein et al. ICALP 2015], where $m$ is the current number of edges in the graph.

Recommendations

• Deterministic dynamic matching in worst-case update time
• Deterministic dynamic matching in \(O(1)\) update time
• Fully dynamic almost-maximal matching: breaking the polynomial worst-case time barrier
• Fully Dynamic Matching: Beating 2-Approximation in Δ^ϵ Update Time
• Improved approximation algorithms for stochastic matching
• Dynamic \((1 + \epsilon)\)-approximate matchings: a density-sensitive approach
• Faster and simpler approximation of stable matchings

Cited in

(31)

• Constructing light spanners deterministically in near-linear time
• Dynamic clustering to minimize the sum of radii
• Deterministic dynamic matching in \(O(1)\) update time
• Dynamic rank-maximal and popular matchings
• Maintaining approximate maximum weighted matching in fully dynamic graphs
• Maintaining approximate maximum matching in an incremental bipartite graph in polylogarithmic update time
• Fully dynamic matching in bipartite graphs
• Deterministic fully dynamic data structures for vertex cover and matching
• Faster fully dynamic matchings with small approximation ratios
• Dynamic \((1 + \epsilon)\)-approximate matchings: a density-sensitive approach
• scientific article; zbMATH DE number 6866348 (Why is no real title available?)
• Fully dynamic maximal matching in O( n) update time (corrected version)
• Local algorithms for bounded degree sparsifiers in sparse graphs
• Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
• Fully dynamic almost-maximal matching: breaking the polynomial worst-case time barrier
• Constructing Light Spanners Deterministically in Near-Linear Time
• Improved algorithm for dynamic b-matching
• Dynamic clustering to minimize the sum of radii
• Round compression for parallel matching algorithms
• (1 + )-approximate incremental matching in constant deterministic amortized time
• Dynamic Matching Algorithms in Practice
• Deterministic dynamic matching in worst-case update time
• Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover
• Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs
• On regularity lemma and barriers in streaming and dynamic matching
• Dynamic \(((1+\epsilon)\ln n)\)-approximation algorithms for minimum set cover and dominating set
• Dynamic matching with better-than-2 approximation in polylogarithmic update time
• Simple dynamic spanners with near-optimal recourse against an adaptive adversary
• Dynamic matching with better-than-2 approximation in polylogarithmic update time
• Deterministic rounding of dynamic fractional matchings
• Minimizing recourse in an adaptive balls and bins game

This page was built for publication: New deterministic approximation algorithms for fully dynamic matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361847)