A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover

Preprint
Publisher Website
Google Scholar
Abstract
The paper describes a simple deterministic parallel/distributed (2+epsilon)-approximation algorithm for the minimum-weight vertex-cover problem and its dual (edge/element packing).