Maintaining a large matching and a small vertex cover
Author(s)
Onak, Krzysztof; Rubinfeld, Ronitt
DownloadRubinfeld_maintaining a large.pdf (154.8Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2010-06Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
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
ISBN
978-1-4503-0050-6