Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2010

Highly Cited

2010

This paper presents an O(1.2738^k+kn)-time polynomial-space algorithm for Vertex Cover improving the previous O(1.286^k+kn)-time… Expand

Highly Cited

2009

Highly Cited

2009

We reduce the approximation factor for the vertex cover to 2 − Θ (1/&sqrt;logn) (instead of the previous 2 − Θ ln ln n/2ln n… Expand

Highly Cited

2008

Highly Cited

2008

Based on a conjecture regarding the power of unique 2-prover-1-round games presented in [S. Khot, On the power of unique 2-Prover… Expand

Highly Cited

2006

Highly Cited

2006

This paper presents an O(1.2738k + kn)-time polynomial-space parameterized algorithm for Vertex Cover improving the previous O(1… Expand

Highly Cited

2001

Highly Cited

2001

Recently, there has been increasing interest and progress in lowering the worst-case time complexity for well-known NP-hard… Expand

Highly Cited

1999

Highly Cited

1999

Recently, there have been increasing interests and progresses in lowering the worst case time complexity for well-known NP-hard… Expand

Highly Cited

1983

Highly Cited

1983

A local-ratio theorem for approximating the weighted vertex cover problem is presented. It consists of reducing the weights of… Expand

Highly Cited

1983

Highly Cited

1983

Abstract In this paper we describe a collection of efficient algorithms that deliver approximate solution to the weighted stable… Expand

Highly Cited

1982

Highly Cited

1982

We propose a heuristic that delivers in $O(n^3 )$ steps a solution for the set covering problem the value of which does not… Expand

Highly Cited

1981

Highly Cited

1981

Abstract A linear time approximation algorithm for the weighted set-covering problem is presented. For the special case of the… Expand