Dynamic Approximate Vertex Cover and Maximum Matching
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 hand...
| Principais autores: | , |
|---|---|
| Outros Autores: | |
| Formato: | Artigo |
| Idioma: | en_US |
| Publicado em: |
Springer Berlin / Heidelberg
2012
|
| Acesso em linha: | http://hdl.handle.net/1721.1/73896 https://orcid.org/0000-0002-4353-7639 |