Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks.

Matti Åstrand Jukka Suomela

Published in: SPAA (2010)

Keyphrases

approximation algorithms
set cover
vertex cover
np hard
special case
worst case
primal dual
minimum cost
precedence constraints
constant factor
approximation ratio
complex networks
optimal solution
dynamic programming
scheduling problem
undirected graph