Vertex cover

Known as: Hitting set problem, Vertex covering number, Minimum cover 
In the mathematical discipline of graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices such that each edge of the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper presents anO(1.2738k+kn)-time polynomial-space algorithm forVertex Cover improving the previous O(1.286k + kn)-time… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This paper presents an O(1.2738 + kn)-time polynomialspace parameterized algorithm for Vertex Cover improving the previous O(1… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We reduce the approximation factor for the vertex cover to 2 − Θ (1/&sqrt;logn) (instead of the previous 2 − Θ ln ln n/2ln n… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The computational challenge posed by NP-hard problems has inspired the development of a wide range of algorithmic techniques. Due… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
1 I n t r o d u c t i o n Given a hypergraph H= (V,E), a ver tex cover of H is a set C C V such that for every e E E, there… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The VERTEX COVER problem asks, for input consisting of a graph G on n vertices, and a positive integer k, whether there is a set… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A cover in a graph G is a set of vertices C such that each edge of G has at least one endpoint in C. The vertex cover problem is… (More)
Is this relevant?