Hardness of approximation

Known as: Inapproximability 
In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1992-2018
0204019922018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
This article accompanies the talk given by the author at the International Congress of Mathematicians, 2014. The article sketches… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We study the <i>verification</i> problem in distributed networks, stated as follows. Let H be a subgraph of a network G where… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
  • Samuel Safra
  • 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
2003
Highly Cited
2003
We consider the problem to determine the maximal number of satisfiable equations in a linear system chosen at random. We make… (More)
  • figure 4.1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We investigate relations between average case complexity and the complexity of approximation. Our preliminary findings indicate… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In the survivable network design problem (SNDP), the goal is to find a minimum-cost spanning subgraph satisfying certain… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… (More)
  • figure 1
  • table I
  • table II
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We refine the complexity analysis of approximation problems by relating it to a new parameter calledgap location. Many of the… (More)
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… (More)
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… (More)
Is this relevant?