Sciweavers

Share
WDAG
2009
Springer

A Local 2-Approximation Algorithm for the Vertex Cover Problem

9 years 1 months ago
A Local 2-Approximation Algorithm for the Vertex Cover Problem
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds, where ∆ is the maximum degree of the graph. For ∆ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.
Matti Åstrand, Patrik Floréen, Valent
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where WDAG
Authors Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto
Comments (0)
books