A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover
Samir Khuller, Uzi Vishkin, Neal Young
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).
Create a lesson
Related papers
The Matching Number Characterizes the Query Complexity of Edge Counting and Degree Moment Estimation
Chenglin Fan, Wonseok Shin
Faster Deterministic Approximation for Counting Knapsack
Ce Jin, Jaewoo Park, Barna Saha
Many Scores Force Many Reads: An Optimality Proof for Score of Parentheses
Andrew Au
Constructive Arboricity in Almost-Linear Time for Dense Graphs
Iman Gholami, Mohammad T. Hajiaghayi, Mahdi JafariRaviz et al.
Tight asymptotic competitive ratio for the Canadian Traveller Problem on unit-weighted grids
Pierre Bergé, Vsevolod Chernyshev, Malory Marin et al.
Breaking Two Barriers for Dynamic Planar Reachability
Adam Karczmarz, Michał Włodarczyk