Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

PTAS reduction

Known as: PTAS 
In computational complexity theory, a PTAS reduction is an approximation-preserving reduction that is often used to perform reductions between… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
I BORRES MP, AHLSTEDT S, BJORKSTEN B. Cultures of human cord blood metachromatic cells in relation to family history of atopy… Expand
Review
2008
Review
2008
  • D. Marx
  • Comput. J.
  • 2008
  • Corpus ID: 17172193
Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard… Expand
  • table 1
  • table 2
  • figure 1
Highly Cited
2006
Highly Cited
2006
Frieze et al. [17] proved that a small sample of rows of a given matrix <i>A</i> contains a low-rank approximation <i>D</i> that… Expand
Highly Cited
2004
Highly Cited
2004
  • Subhash Khot
  • 45th Annual IEEE Symposium on Foundations of…
  • 2004
  • Corpus ID: 16514252
Assuming that NP /spl nsube//spl cap//sub /spl epsi/> 0/ BPTIME(2/sup n/spl epsi//), we show that graph min-bisection, densest… Expand
  • figure 1
Highly Cited
2004
Highly Cited
2004
We consider the following clustering problem: we have a complete graph on n vertices (items), where each edge (u, v) is labeled… Expand
  • figure 1
Highly Cited
2003
Highly Cited
2003
We study the combinatorial structure and computational complexity of extreme Nash equilibria, ones that maximize or minimize a… Expand
  • table 2
  • table 3
  • figure 8
  • figure 9
  • table 2
Highly Cited
2003
Highly Cited
2003
A connected dominating set in a graph is a subset of vertices such that every vertex is either in the subset or adjacent to a… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2000
Highly Cited
2000
The Multiple Knapsack problem (MKP) is a natural and well known generalization of the single knapsack problem and is defined as… Expand
  • figure 1
Highly Cited
1999
Highly Cited
1999
We show that any polygonal subdivision in the plane can be converted into an "m-guillotine" subdivision whose length is at most… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
  • figure 4.1
Highly Cited
1978
Highly Cited
1978
We consider one of the basic, well-studied problems of scheduling theory, that of nonpreemptively scheduling n independent tasks… Expand