A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover
classification
💻 cs.DS
cs.DC
keywords
approximationparallelalgorithmappliedcoverdescribesdeterministicdistributed
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.