English

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

Data Structures and Algorithms 2015-06-02 v1 Distributed, Parallel, and Cluster Computing
Authors: Samir Khuller , Uzi Vishkin , Neal Young
View on arXiv ↗ PDF ↗ DOI ↗

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).

Keywords

approximation algorithm metric space computational geometry

Cite

@article{arxiv.cs/0205037,
  title  = {A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover},
  author = {Samir Khuller and Uzi Vishkin and Neal Young},
  journal= {arXiv preprint arXiv:cs/0205037},
  year   = {2015}
}

Comments

conference version appeared in IPCO'93

Related papers

View all related →
Data Structures and Algorithms · Computer Science
A Massively Parallel Algorithm for Minimum Weight Vertex Cover
Mohsen Ghaffari, Ce Jin, Daan Nilis
2020-05-22
Data Structures and Algorithms · Computer Science
Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover
Nate Veldt
2022-09-13
Distributed, Parallel, and Cluster Computing · Computer Science
A Distributed $(2+\epsilon)$-Approximation for Vertex Cover in $O(\log{\Delta}/\epsilon\log\log{\Delta})$ Rounds
Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman
2016-02-15
Distributed, Parallel, and Cluster Computing · Computer Science
A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\log n\log\Delta / \log^2\log\Delta)$ Rounds
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2018-05-24
Data Structures and Algorithms · Computer Science
Sequential and Parallel Algorithms for Mixed Packing and Covering
Neal E. Young
2016-01-19
Data Structures and Algorithms · Computer Science
Forest Covers and Bounded Forest Covers
Daya Ram Gaur, Barun Gorain, Shaswati Patra, Rishi Ranjan Singh
2024-11-26
Distributed, Parallel, and Cluster Computing · Computer Science
Optimal Distributed Weighted Set Cover Approximation
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2018-08-20
Data Structures and Algorithms · Computer Science
Distributed algorithms for covering, packing and maximum weighted matching
Christos Koufogiannakis, Neal E. Young
2020-05-29
Data Structures and Algorithms · Computer Science
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings
Salwa Faour, Marc Fuchs, Fabian Kuhn
2023-08-09
Data Structures and Algorithms · Computer Science
A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems
Andrés Fielbaum, Ignacio Morales, José Verschae
2019-12-30
Data Structures and Algorithms · Computer Science
An approximation algorithm for the total cover problem
Pooya Hatami
2010-08-20
Data Structures and Algorithms · Computer Science
Survival Network Design of Doubling Dimension Metrics
Hao-Hsiang Hung
2012-10-23
Data Structures and Algorithms · Computer Science
An $O(1)$-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity
Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao +1
2018-02-21
Data Structures and Algorithms · Computer Science
Minimum Vertex Cover in Rectangle Graphs
Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
2010-01-20
Computational Complexity · Computer Science
On the Complexity of Edge Packing and Vertex Packing
Sameera Muhamed Salam, K. N. Parvathy, K. S. Sudeep, K. Murali Krishnan
2011-04-08
Distributed, Parallel, and Cluster Computing · Computer Science
Distributed Weighted Matching via Randomized Composable Coresets
Sepehr Assadi, MohammadHossein Bateni, Vahab Mirrokni
2019-06-06
Distributed, Parallel, and Cluster Computing · Computer Science
Optimal Distributed Covering Algorithms
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2019-05-31
Data Structures and Algorithms · Computer Science
A Near Optimal Approximation Algorithm for Vertex-Cover Problem
Deepak Puthal
2013-09-20
Data Structures and Algorithms · Computer Science
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers
Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy +1
2013-12-30
Data Structures and Algorithms · Computer Science
Minimum-weight partitioning of a set with associated subsets
Yakov Zinder, Bertrand M. T. Lin, Joanna Berlińska
2022-12-13
Data Structures and Algorithms · Computer Science
Solving Packing and Covering LPs in $\tilde{O}(\frac{1}{\epsilon^2})$ Distributed Iterations with a Single Algorithm and Simpler Analysis
Jelena Diakonikolas, Lorenzo Orecchia
2017-10-26
Computational Complexity · Computer Science
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
Piotr Berman, Marek Karpinski, Andrzej Lingas
2009-09-30
Computational Geometry · Computer Science
Approximately: Independence Implies Vertex Cover
Sariel Har-Peled
2026-02-23
Data Structures and Algorithms · Computer Science
Weighted Upper Edge Cover: Complexity and Approximability
Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jerome Monnot, Florian Sikora
2018-11-08
Databases · Computer Science
K-Join: Combining Vertex Covers for Parallel Joins
Simon Frisk, Austen Fan, Paraschos Koutris
2026-03-12
R2 v1 2026-07-22T12:19:51.195Z