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

The state-of-the-art algorithm for maintaining an approximate maximum matching in fully dynamic graphs has a polynomial worst-case update time, even for poor approximation guarantees. Bhattacharya, Henzinger and Nanongkai showed how to maintain a constant approximation to the minimum vertex cover, and thus also a constant-factor estimate of the maximum matching size, with polylogarithmic worst-case update time. Later (in SODA’17 Proc.) they improved the approximation to 2 + . Nevertheless, the fundamental problem of maintaining an approximate matching with sub-polynomial worst-case time bounds remained open. We present a randomized algorithm for maintaining an almost-maximal matching in fully dynamic graphs with polylogarithmic worst-case update time. Such a matching provides (2 + )approximations for both maximum matching and minimum vertex cover, for any > 0. The worst-case update time of our algorithm, O(poly(logn, −1)), holds deterministically, while the almost-maximality guarantee holds with high probability. Our result was done independently of the (2+ )-approximation result of Bhattacharya et al., thus settling the aforementioned problem on dynamic matchings and providing essentially the best possible approximation guarantee for dynamic vertex cover (assuming the unique games conjecture). To prove this result, we exploit a connection between the standard oblivious adversarial model, which can be viewed as inherently “online”, and an “offline” model where some (limited) information on the future can be revealed efficiently upon demand. Our randomized algorithm is derived from a deterministic algorithm in this offline model. This approach gives an elegant way to analyze randomized dynamic algorithms, and is of independent interest. 2012 ACM Subject Classification Mathematics of computing → Graph algorithms, Theory of computation→ Graph algorithms analysis, Theory of computation→ Dynamic graph algorithms

[1]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

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

[3]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

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

[5]  Rajeev Raman,et al.  Persistence, amortization and randomization , 1991, SODA '91.

[6]  Clifford Stein,et al.  Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms , 2017, ICALP.

[7]  Sandeep Sen,et al.  Fully Dynamic Maximal Matching in O (log n) Update Time , 2011, FOCS.

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

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

[10]  Monika Henzinger,et al.  New deterministic approximation algorithms for fully dynamic matching , 2016, STOC.

[11]  Monika Henzinger,et al.  Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time , 2017, SODA.

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

[13]  Shay Solomon Dynamic Approximate Matchings with an Optimal Recourse Bound , 2018, ArXiv.

[14]  Moses Charikar,et al.  Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds , 2017, ArXiv.

[15]  Paul F. Dietz,et al.  Two algorithms for maintaining order in a list , 1987, STOC.

[16]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[17]  Shay Solomon,et al.  Fully Dynamic Maximal Matching in Constant Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

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

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