English

A simple local 3-approximation algorithm for vertex cover

Distributed, Parallel, and Cluster Computing 2009-05-02 v1
Authors: Valentin Polishchuk , Jukka Suomela
View on arXiv ↗ PDF ↗ DOI ↗

Abstract

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required.

Keywords

computational geometry graph algorithms approximation algorithm

Cite

@article{arxiv.0810.2175,
  title  = {A simple local 3-approximation algorithm for vertex cover},
  author = {Valentin Polishchuk and Jukka Suomela},
  journal= {arXiv preprint arXiv:0810.2175},
  year   = {2009}
}

Comments

6 pages, 1 figure

Related papers

View all related →
Data Structures and Algorithms · Computer Science
A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs
Qiaoming Han, Abraham P. Punnen, Yinyu Ye
2007-12-21
Data Structures and Algorithms · Computer Science
A local search $4/3$-approximation algorithm for the minimum $3$-path partition problem
Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu +4
2018-12-27
Data Structures and Algorithms · Computer Science
Parameterized algorithm for 3-path vertex cover
Dekel Tsur
2018-09-11
Distributed, Parallel, and Cluster Computing · Computer Science
A tight local algorithm for the minimum dominating set problem in outerplanar graphs
Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek
2022-11-22
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
Improved approximation algorithms for hitting 3-vertex paths
Samuel Fiorini, Gwenaël Joret, Oliver Schaudt
2019-02-25
Data Structures and Algorithms · Computer Science
Weighted vertex cover on graphs with maximum degree 3
Dekel Tsur
2018-11-01
Data Structures and Algorithms · Computer Science
A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
Katie Clinch, Serge Gaspers, Tao Zixu He, Simon Mackenzie +1
2025-10-13
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
Distributed Vertex Cover Algorithms For Wireless Sensor Networks
Vedat Kavalci, Aybars Ural, Orhan Dagdeviren
2014-02-11
Combinatorics · Mathematics
A modified greedy algorithm to improve bounds for the vertex cover number
R. Dharmarajan, D. Ramachandran
2019-01-04
Data Structures and Algorithms · Computer Science
Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
Peter Davies-Peck
2026-05-14
Distributed, Parallel, and Cluster Computing · Computer Science
Lower Bounds for Local Approximation
Mika Göös, Juho Hirvonen, Jukka Suomela
2013-12-24
Data Structures and Algorithms · Computer Science
Approximation Algorithms for Edge Partitioned Vertex Cover Problems
Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
2015-03-19
Data Structures and Algorithms · Computer Science
Stochastic Minimum Vertex Cover in General Graphs: a $3/2$-Approximation
Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab
2023-02-07
Discrete Mathematics · Computer Science
A Proposed Algorithm for Minimum Vertex Cover Problem and its Testing
Gang Hu
2016-10-30
Disordered Systems and Neural Networks · Physics
Local Algorithms for Graphs
David Gamarnik, Mathieu Hemery, Samuel Hetterich
2014-09-19
Data Structures and Algorithms · Computer Science
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
Mingyu Xiao, Shaowei Kou
2017-08-08
Numerical Analysis · Mathematics
On Optimization of 1/2-Approximation Path Cover Algorithm
Junyuan Lin, Guangpeng Ren
2021-01-25
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
Approximate Bipartite Vertex Cover in the CONGEST Model
Salwa Faour, Fabian Kuhn
2020-11-20
Distributed, Parallel, and Cluster Computing · Computer Science
Optimal Distributed Covering Algorithms
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman
2019-05-31
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
Data Structures and Algorithms · Computer Science
Vertex Covers Revisited: Indirect Certificates and FPT Algorithms
Leizhen Cai
2018-07-31
Quantum Physics · Physics
Constrained local Hamiltonians: quantum generalizations of Vertex Cover
Ojas Parekh, Chaithanya Rayudu, Kevin Thompson
2024-09-09
R2 v1 2026-06-21T11:30:02.190Z