Skip to search formSkip to main contentSemantic Scholar

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

2015

Highly Cited

2015

The Euclidean $k$-means problem is a classical problem that has been extensively studied in the theoretical computer science… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

We study the verification problem in distributed networks, stated as follows. Let H be a subgraph of a network G where each… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We refine the complexity analysis of approximation problems by relating it to a new parameter calledgap location. Many of the… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Abstract.We show that the Multicut, Sparsest-Cut, and Min-2CNF ≡ Deletion problems are NP-hard to approximate within every… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

Let p > 1 be any fixed real. We show that assuming NP /spl nsube/ RP, it is hard to approximate the shortest vector problem (SVP… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that… Expand

Is this relevant?