Show simple item record

dc.contributor.authorOnak, Krzysztof
dc.contributor.authorRubinfeld, Ronitt
dc.date.accessioned2012-10-11T19:28:20Z
dc.date.available2012-10-11T19:28:20Z
dc.date.issued2010-10
dc.identifier.isbn978-3-642-16366-1
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.urihttp://hdl.handle.net/1721.1/73896
dc.description.abstractWe 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.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant 0732334)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant 0728645)en_US
dc.description.sponsorshipMarie Curie International (Reintegration Grant PIRG03-GA-2008-231077)en_US
dc.description.sponsorshipIsrael Science Foundation (Grant 1147/09)en_US
dc.description.sponsorshipIsrael Science Foundation (Grant 1675/09)en_US
dc.language.isoen_US
dc.publisherSpringer Berlin / Heidelbergen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/978-3-642-16367-8_28en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleDynamic Approximate Vertex Cover and Maximum Matchingen_US
dc.typeArticleen_US
dc.identifier.citationOnak, Krzysztof, and Ronitt Rubinfeld. “Dynamic Approximate Vertex Cover and Maximum Matching.” Property Testing. Ed. Oded Goldreich. LNCS Vol. 6390. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. 341–345.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorOnak, Krzysztof
dc.contributor.mitauthorRubinfeld, Ronitt
dc.relation.journalProperty Testingen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsOnak, Krzysztof; Rubinfeld, Ronitten
dc.identifier.orcidhttps://orcid.org/0000-0002-4353-7639
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record