Dynamic Approximate Vertex Cover and Maximum Matching

We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first randomized data structure that simultaneously achieves a constant approximation factor and handles a sequence of k updates in k ċ polylog(n) time. Previous data structures require a polynomial amount of computation per update. The starting point of our construction is a distributed algorithm of Parnas and Ron (Theor. Comput. Sci. 2007), which they designed for their sublinear-time approximation algorithm for the vertex cover size. This leads us to wonder whether there are other connections between sublinear algorithms and dynamic data structures.

[1]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.

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

[3]  Piotr Sankowski,et al.  Faster dynamic matchings and vertex connectivity , 2007, SODA '07.

[4]  Mikkel Thorup,et al.  Worst-case update times for fully-dynamic all-pairs shortest paths , 2005, STOC '05.

[5]  Mariano Zelke,et al.  Weighted Matching in the Semi-Streaming Model , 2007, Algorithmica.

[6]  David Eppstein,et al.  Dynamic graph algorithms , 2010 .

[7]  Mikkel Thorup,et al.  Fully-dynamic min-cut , 2001, STOC '01.

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

[9]  Errol L. Lloyd,et al.  Fully Dynamic Maintenance of Vertex Cover , 1993, WG.

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

[11]  Philip N. Klein,et al.  A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs , 1998, Algorithmica.

[12]  Shimon Even,et al.  An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[13]  Dana Ron,et al.  On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..

[14]  David Eppstein,et al.  Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.

[15]  Sorin C. Popescu,et al.  Lidar Remote Sensing , 2011 .

[16]  Boaz Patt-Shamir,et al.  Distributed approximate matching , 2007, PODC '07.

[17]  David Eppstein,et al.  Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.