Maintaining a large matching and a small vertex cover
Name
Rubinfeld_maintaining a large.pdf
Size
154.86 KB
Format
Adobe PDF
Checksum (MD5)
6953d3ee32441046006f90d1c845e6c6
Author(s)
Onak, Krzysztof
Rubinfeld, Ronitt
Date Issued
June 2010
Journal
Proceedings of the 42nd ACM symposium on Theory of computing (STOC '10)
Publisher
Association for Computing Machinery (ACM)
Citation
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.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/1806689.1806753
