Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models

We study the Maximum Cardinality Matching (MCM) and the Maximum Weight Matching (MWM) problems, on trees and on some special classes of graphs, in the Online Preemptive and the Incremental Dynamic Graph models. In the Online Preemptive model, the edges of a graph are revealed one by one and the algorithm is required to always maintain a valid matching. On seeing an edge, the algorithm has to either accept or reject the edge. If accepted, then the adjacent edges are discarded, and all rejections are permanent. In this model, the complexity of the problems is settled for deterministic algorithms [11, 15]. Epstein et al. [5] gave a 5.356-competitive randomized algorithm for MWM, and also proved a lower bound of 1.693 for MCM. The same lower bound applies for MWM.

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

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

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

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

[5]  Ashwinkumar Badanidiyuru Varadaraja.  Buyback problem: approximate matroid intersection with cancellation costs , 2011, ICALP 2011.

[6]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

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

[8]  Sundar Vishwanathan,et al.  On Randomized Algorithms for Matching in the Online Preemptive Model , 2015, ESA.

[9]  Manoj Gupta,et al.  Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time , 2014, FSTTCS.

[10]  Joan Feigenbaum,et al.  On graph problems in a semi-streaming model , 2005, Theor. Comput. Sci..

[11]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[12]  Ashwinkumar Badanidiyuru,et al.  Buyback Problem - Approximate Matroid Intersection with Cancellation Costs , 2010, ICALP.

[13]  Leah Epstein,et al.  Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model , 2010, STACS.

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

[15]  Andrew McGregor,et al.  Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.

[16]  Bala Kalyanasundaram,et al.  Online Weighted Matching , 1993, J. Algorithms.

[17]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[18]  Leah Epstein,et al.  Improved Bounds for Online Preemptive Matching , 2012, STACS.

[19]  Leah Epstein,et al.  Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model , 2009, SIAM J. Discret. Math..