Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis

It is a long-standing problem to lower bound the performance of randomized greedy algorithms for maximum matching. Aronson, Dyer, Frieze and Suen [1]studied the modified randomized greedy (MRG) algorithm and proved that it approximates the maximum matching within a factor of at least 1/2 + 1/400,000. They use heavy combinatorial methods in their analysis. We introduce a new technique we call Contrast Analysis, and show a 1/2 + 1/256 performance lower bound for the MRG algorithm. The technique seems to be useful not only for the MRG, but also for other related algorithms.

[1]  Gagan Goel,et al.  Matching with Our Eyes Closed , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[2]  N. Alon,et al.  The Probabilistic Method: Alon/Probabilistic , 2008 .

[3]  B. Pittel,et al.  The average performance of the greedy matching algorithm , 1993 .

[4]  Claire Mathieu,et al.  On-line bipartite matching made simple , 2008, SIGA.

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

[6]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[7]  Alan M. Frieze,et al.  Maximum matchings in sparse random graphs: Karp-Sipser revisited , 1998, Random Struct. Algorithms.

[8]  Alan M. Frieze,et al.  Analysis of a simple greedy matching algorithm on random cubic graphs , 1995, SODA '93.

[9]  Mohammad Mahdian,et al.  Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.

[10]  Aranyak Mehta,et al.  Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.

[11]  Zevi Miller,et al.  On randomized greedy matchings , 1997, Random Struct. Algorithms.

[12]  Martin E. Dyer,et al.  Randomized Greedy Matching II , 1995, Random Struct. Algorithms.

[13]  B. Korte,et al.  An Analysis of the Greedy Heuristic for Independence Systems , 1978 .

[14]  Richard M. Karp,et al.  Maximum Matchings in Sparse Random Graphs , 1981, FOCS 1981.

[15]  Pushkar Tripathi,et al.  Allocation problems with partial information , 2012 .

[16]  Martin E. Dyer,et al.  Randomized Greedy Matching , 1991, Random Struct. Algorithms.

[17]  Dorit S. Hochbaum,et al.  A Fast Perfect-Matching Algorithm in Random Graphs , 1990, SIAM J. Discret. Math..

[18]  Aranyak Mehta,et al.  Online bipartite matching with unknown distributions , 2011, STOC '11.

[19]  Gottfried Tinhofer.  A probabilistic analysis of some greedy cardinality matching algorithms , 1984, Ann. Oper. Res..

[20]  M. Sipser,et al.  Maximum matching in sparse random graphs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).