Sciweavers

Share
CORR
2008
Springer

A simple local 3-approximation algorithm for vertex cover

8 years 2 months ago
A simple local 3-approximation algorithm for vertex cover
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. Key words: approximation algorithms, distributed computing, graph algorithms, local algorithms
Valentin Polishchuk, Jukka Suomela
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Valentin Polishchuk, Jukka Suomela
Comments (0)
books