Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs

We present a Logspace Approximation Scheme (LSAS), i.e. an approximation algorithm for maximum matching in planar graphs (not necessarily bipartite) that achieves an approximation ratio arbitrarily close to one, using only logarithmic space. This deviates from the well known Baker's approach for approximation in planar graphs by avoiding the use of distance computation - which is not known to be in Logspace. Our algorithm actually works for any "recursively sparse" graph class which contains a linear size matching and also for certain other classes like bounded genus graphs. The scheme is based on an LSAS in bounded degree graphs which are not known to be amenable to Baker's method. We solve the bounded degree case by parallel augmentation of short augmenting paths. Finding a large number of such disjoint paths can, in turn, be reduced to finding a large independent set in a bounded degree graph. The bounded degree assumption allows us to obtain a Logspace algorithm.

[1]  Vijay V. Vazirani,et al.  NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems , 1989, Inf. Comput..

[2]  Thanh Minh Hoang.  On the Matching Problem for Special Graph Classes , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[3]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[4]  Erik D. Demaine,et al.  Tight bounds on maximal and maximum matchings , 2004, Discret. Math..

[5]  Meena Mahajan,et al.  A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) , 2000, STOC '00.

[6]  A. Meyer.  Review: Walter J. Savitch, Relationships between Nondeterministic and Deterministic Tape Complexities , 1974 .

[7]  Gary L. Miller,et al.  Flow in Planar Graphs with Multiple Sources and Sinks , 1995, SIAM J. Comput..

[8]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[9]  Meena Mahajan,et al.  Planarity, Determinants, Permanents, and (Unique) Matchings , 2010, TOCT.

[10]  Binhai Zhu,et al.  Combinatorial Optimization and Applications , 2013 .

[11]  Jaroslav Nesetril,et al.  Sparsity - Graphs, Structures, and Algorithms , 2012, Algorithms and combinatorics.

[12]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[13]  Raghav Kulkarni,et al.  Space Complexity of Optimization Problems in Planar Graphs , 2014, TAMC.

[14]  Raghav Kulkarni,et al.  Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs , 2009, Theory of Computing Systems.

[15]  Eric Allender,et al.  Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds , 1999, J. Comput. Syst. Sci..

[16]  Baruch Schieber,et al.  A sublinear space, polynomial time algorithm for directed s-t connectivity , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[17]  Stefan Hougardy,et al.  Approximating weighted matchings in parallel , 2006, Inf. Process. Lett..

[18]  Osamu Watanabe,et al.  Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability , 2014, MFCS.

[19]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[20]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

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

[22]  Therese C. Biedl.  Linear reductions of maximum matching , 2001, SODA '01.

[23]  Heribert Vollmer,et al.  Introduction to Circuit Complexity: A Uniform Approach , 2010 .

[24]  Till Tantau.  Logspace Optimization Problems and Their Approximability Properties , 2005, FCT.

[25]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[26]  Meena Mahajan,et al.  Some perfect matchings and perfect half-integral matchings in NC , 2008, Chic. J. Theor. Comput. Sci..

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

[28]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[29]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[30]  Vijay V. Vazirani,et al.  NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems , 1988, SWAT.

[31]  Raghav Kulkarni.  On the Power of Isolation in Planar Graphs , 2011, TOCT.

[32]  Reinhard Diestel,et al.  Graph Theory, 4th Edition , 2012, Graduate texts in mathematics.

[33]  D. West.  Introduction to Graph Theory , 1995 .

[34]  Jane Zundel.  MATCHING THEORY , 2011 .

[35]  Seth Pettie,et al.  Linear-Time Approximation for Maximum Weight Matching , 2014, JACM.