Maintaining a large matching and a small vertex cover
Author(s)Onak, Krzysztof; Rubinfeld, Ronitt
MetadataShow full item record
We consider the problem of maintaining a large matching and 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, where n is the number of vertices in the graph. Previous data structures require a polynomial amount of computation per update.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Proceedings of the 42nd ACM symposium on Theory of computing (STOC '10)
Association for Computing Machinery (ACM)
Krzysztof Onak and Ronitt Rubinfeld. 2010. Maintaining a large matching and a small vertex cover. In Proceedings of the 42nd ACM symposium on Theory of computing (STOC '10). ACM, New York, NY, USA, 457-464.
Author's final manuscript