# Vertex cover

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Discrete Applied Mathematics
- 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

- Theor. Comput. Sci.
- 2010

This paper presents anO(1.2738k+kn)-time polynomial-space algorithm forVertex Cover improving the previous O(1.286k + kn)-timeâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- MFCS
- 2006

This paper presents an O(1.2738 + kn)-time polynomialspace parameterized algorithm for Vertex Cover improving the previous O(1â€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- SIAM J. Comput.
- 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

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

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- ACM Trans. Algorithms
- 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

- ALENEX/ANALC
- 2004

The computational challenge posed by NP-hard problems has inspired the development of a wide range of algorithmic techniques. Dueâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- SODA
- 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

- Inf. Process. Lett.
- 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

- Discrete Applied Mathematics
- 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?