| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428141 | Information Processing Letters | 2009 | 4 Pages |
Abstract
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
