A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover
Samir Khuller, Uzi Vishkin, Neal Young
TL;DR
This paper introduces a simple deterministic parallel algorithm that approximates the minimum-weight vertex cover and its dual problem with a factor of (2+epsilon), improving efficiency in distributed computing.
Contribution
It presents a novel parallel approximation technique for weighted vertex cover and its dual, enhancing deterministic approaches in distributed settings.
Findings
Achieves a (2+epsilon)-approximation in parallel/distributed models.
Provides a simple and deterministic algorithm for weighted vertex cover.
Improves efficiency and approximation guarantees over previous methods.
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Computational Geometry and Mesh Generation · Advanced Graph Theory Research