Vertex Cover Approximation
Vertex Cover Approximation is a greedy algorithm that belongs to the class of approximation algorithms, specifically designed to efficiently compute a near-optimal solution to the vertex cover problem by iteratively selecting endpoints of uncovered edges until all edges are incident to at least one selected vertex.
300
Publications
18.7K
Citations
547
Authors
273
Institutions
Publications per year
2017–2026
53
300
Approximation algorithms for NP-complete problems on planar graphs
Brenda S. Baker · Journal of the ACM · 1994 · 973 citations · Full text
Subhash Khot, Oded Regev · Journal of Computer and System Sciences · 2007 · 761 citations
On the hardness of approximating vertex cover
Irit Dinur, Samuel Safra · Annals of Mathematics · 2005 · 635 citations · Full text
Simple heuristics for unit disk graphs
Madhav Marathe, Heinz Breu, Harry B. Hunt et al. · Networks · 1995 · 494 citations
1–5 of 300
547
8
h-index
7
h-index
7
h-index
6
h-index
6
h-index
1–5 of 547
273

Tel Aviv University
Tel Aviv, Israel
11 h-index
17 publications
2.1K citations
Princeton University
Princeton, United States
11 h-index
16 publications
1.7K citations
Carnegie Mellon University
Pittsburgh, United States
10 h-index
16 publications
936 citations
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
18 publications
1.6K citations

Institute of Mathematical Sciences
Chennai, India
8 h-index
18 publications
1.1K citations
University of Maryland, College Park
College Park, United States
7 h-index
17 publications
1.6K citations
ETH Zurich
Zurich, Switzerland
7 h-index
9 publications
1.3K citations
Dalle Molle Institute for Artificial Intelligence Research
Lugano, Switzerland
7 h-index
9 publications
593 citations
1–8 of 273
17 publications · 959 citations
14
h-index
19 publications · 842 citations
14
h-index
15 publications · 862 citations
13
h-index
10 publications · 536 citations
10
h-index
9 publications · 1.4K citations
9
h-index
1–5