| dc.contributor.author | Onak, Krzysztof | |
| dc.contributor.author | Rubinfeld, Ronitt | |
| dc.date.accessioned | 2012-09-05T19:50:53Z | |
| dc.date.available | 2012-09-05T19:50:53Z | |
| dc.date.issued | 2010-06 | |
| dc.identifier.isbn | 978-1-4503-0050-6 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/72534 | |
| dc.description.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. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.). (Grant number 0732334) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.). (Grant number 0728645) | en_US |
| dc.description.sponsorship | Marie Curie International Reintegration Grants (Grant number PIRG03-GA-2008-231077) | en_US |
| dc.description.sponsorship | Israel Science Foundation (Grant number 1147/09) | en_US |
| dc.description.sponsorship | Israel Science Foundation (Grant number 1675/09) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Association for Computing Machinery (ACM) | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1145/1806689.1806753 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
| dc.source | MIT web domain | en_US |
| dc.title | Maintaining a large matching and a small vertex cover | en_US |
| dc.type | Article | en_US |
| dc.identifier.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. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.approver | Rubinfeld, Ronitt | |
| dc.contributor.mitauthor | Onak, Krzysztof | |
| dc.contributor.mitauthor | Rubinfeld, Ronitt | |
| dc.relation.journal | Proceedings of the 42nd ACM symposium on Theory of computing (STOC '10) | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| dspace.orderedauthors | Onak, Krzysztof; Rubinfeld, Ronitt | en |
| dc.identifier.orcid | https://orcid.org/0000-0002-4353-7639 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
