  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.
