Dynamic approximate vertex cover and maximum matching

Krzysztof Onak*, Ronitt Rubinfeld

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationProperty Testing - Current Research and Surveys
Number of pages5
StatePublished - 2010
EventMini-Workshop on Property Testing - Beijing, China
Duration: 8 Jan 201010 Jan 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6390 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceMini-Workshop on Property Testing


  • dynamic algorithms
  • maximum matching
  • vertex cover


Dive into the research topics of 'Dynamic approximate vertex cover and maximum matching'. Together they form a unique fingerprint.

Cite this