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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2017
020406019682017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The map-reduce paradigm is now standard in industry and academia for processing large-scale data. In this work, we formalize job… (More)
  • table 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We present approximation algorithms for maximum independent set of pseudo-disks in the plane, both in the weighted and unweighted… (More)
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… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The Euclidean TSP with neighborhoods (TSPN) problem seeks a shortest tour that visits a given collection of n regions… (More)
  • figure 1
  • figure 2
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
  • Subhash Khot
  • 45th Annual IEEE Symposium on Foundations of…
  • 2004
Assuming that NP /spl nsube//spl cap//sub /spl epsi/> 0/ BPTIME(2/sup n/spl epsi//), we show that graph min-bisection, densest… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In this paper, we show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The class PTAS is defined to consist of all NP optimization problems that permit polynomial-time approximation schemes. This… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
item in the big bin and obtains a profit of 1 while OPT = 2. This also shows that ordering bins in non-increasing capacities does… (More)
  • figure 1
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Processing Time first algorithm always finds a schedule having makespan within 43 1. Key words, bin packing, multiprocessor… (More)
Is this relevant?