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
2007
Highly Cited
2007
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Given a point set P ⊆ R<sup>d</sup> the k-means clustering problem is to find a set C=(c<sub>1</sub>,...,c<sub>k</sub>) of k… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane. For the case that the disk… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.5
  • figure 2.6
Is this relevant?
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The d-dimensional vector packing problem is a well-known generalization of the classical bin packing problem: For a given list of… Expand
Is this relevant?
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
Is this relevant?