A Local Computation Approximation Scheme to Maximum Matching

We present a polylogarithmic local computation matching algorithm which guarantees a (1 - e)-approximation to the maximum matching in graphs of bounded degree.

[1]  P. Hall.  On Representatives of Subsets , 1935 .

[2]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[3]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[4]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[5]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[6]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[7]  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).

[8]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[9]  Alon Itai,et al.  A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[10]  Andrzej Czygrinow,et al.  Distributed Algorithm for Better Approximation of the Maximum Matching , 2003, COCOON.

[11]  Piotr Sankowski,et al.  Maximum Matchings in Planar Graphs via Gaussian Elimination , 2004, ESA.

[12]  Piotr Sankowski,et al.  Maximum matchings via Gaussian elimination , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[13]  Shay Kutten,et al.  Efficient Distributed Weighted Matchings on Trees , 2006, SIROCCO.

[14]  Nicholas J. A. Harvey.  Algebraic Structures and Algorithms for Matching and Matroid Problems , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[15]  Roger Wattenhofer,et al.  The price of being near-sighted , 2006, SODA '06.

[16]  Improved distributed approximate matching , 2008, SPAA '08.

[17]  Krzysztof Onak,et al.  Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[19]  Ronitt Rubinfeld,et al.  Fast Local Computation Algorithms , 2011, ICS.

[20]  Noga Alon,et al.  Space-efficient local computation algorithms , 2011, SODA.

[21]  Yishay Mansour,et al.  Converting Online Algorithms to Local Computation Algorithms , 2012, ICALP.