New deterministic approximation algorithms for fully dynamic matching

We present two deterministic dynamic algorithms for the maximum matching problem. (1) An algorithm that maintains a (2+є)-approximate maximum matching in general graphs with O(poly(logn, 1/є)) update time. (2) An algorithm that maintains an αK approximation of the value of the maximum matching with O(n2/K) update time in bipartite graphs, for every sufficiently large constant positive integer K. Here, 1≤ α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 randomized polylogarithmic update time algorithm [Baswana et al. FOCS 2011]. Result (2) achieves a better-than-two approximation with arbitrarily small polynomial update time on bipartite graphs. Previously the best update time for this problem was O(m1/4) [Bernstein et al. ICALP 2015], where m is the current number of edges in the graph.

[1]  Clifford Stein,et al.  Faster Fully Dynamic Matchings with Small Approximation Ratios , 2016, SODA.

[2]  Piotr Sankowski,et al.  Faster dynamic matchings and vertex connectivity , 2007, SODA '07.

[3]  Monika Henzinger,et al.  Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.

[4]  Sandeep Sen,et al.  Fully Dynamic Maximal Matching in O(log n) Update Time , 2015, SIAM J. Comput..

[5]  Shay Solomon,et al.  Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.

[6]  Giuseppe F. Italiano,et al.  Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching , 2015, SODA.

[7]  Tsvi Kopelowitz,et al.  Higher Lower Bounds from the 3SUM Conjecture , 2014, SODA.

[8]  Mihai Patrascu,et al.  Towards polynomial lower bounds for dynamic problems , 2010, STOC '10.

[9]  Amir Abboud,et al.  Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[10]  Claire Mathieu,et al.  Maximum Matching in Semi-streaming with Few Passes , 2011, APPROX-RANDOM.

[11]  Clifford Stein,et al.  Fully Dynamic Matching in Bipartite Graphs , 2015, ICALP.

[12]  Richard Peng,et al.  Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013, 1304.0378.

[13]  V. G. Vizing.  The chromatic class of a multigraph , 1965 .

[14]  David Peleg,et al.  Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach , 2016, SODA.

[15]  Amos Israeli,et al.  An Improved Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[16]  Krzysztof Onak,et al.  Maintaining a large matching and a small vertex cover , 2010, STOC '10.

[17]  Michael Crouch,et al.  Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching , 2014, APPROX-RANDOM.

[18]  Sandeep Sen,et al.  Fully Dynamic Maximal Matching in O (log n) Update Time , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.