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

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Valentin Polishchuk, Jukka Suomela
• Keywords: Algorithms, Constant-time Distributed Algorithm, CORR 2008, Education, Local Algorithms