43 citations · 43 across the 1 of their papers we have counts for
1 paper
Valentin Polishchuk, Jukka Suomela
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 auxilia…