@inproceedings{c86e1b1179914bb5a1df109da1ec5f13,
title = "Dynamic approximate vertex cover and maximum matching",
abstract = "We 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.",
keywords = "dynamic algorithms, maximum matching, vertex cover",
author = "Krzysztof Onak and Ronitt Rubinfeld",
note = "Funding Information: Krzysztof Onak was supported in part by NSF grants 0732334 and 0728645. Ronitt Rubinfeld was supported in part by NSF grants 0732334 and 0728645, Marie Curie Reintegration grant PIRG03-GA-2008-231077, and the Israel Science Foundation grant nos. 1147/09 and 1675/09.; Mini-Workshop on Property Testing ; Conference date: 08-01-2010 Through 10-01-2010",
year = "2010",
doi = "10.1007/978-3-642-16367-8_28",
language = "אנגלית",
isbn = "3642163661",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "341--345",
booktitle = "Property Testing - Current Research and Surveys",
}