Polynomial-time approximation scheme

Known as: Polynomial-time randomized approximation scheme, Efficient polynomial-time randomized approximation scheme, Fully polynomial approximation scheme 
In computer science, a polynomial-time approximation scheme (PTAS) is a type of approximation algorithm for optimization problems (most often, NP… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2017
05010019682017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Given n elements with nonnegative integer weights w1, . . . , wn and an integer capacity C, we consider the counting version of… (More)
Is this relevant?
2007
2007
We present a surprising result that the traveling salesman problem has a polynomial-time approximation scheme when the distances… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
A malleable parallel task is one whose execution time is a function of the number of (identical) processors allotted to it. We… (More)
Is this relevant?
2002
2002
In the bin covering problem there is a group L=(a1; : : : ; an) of items with sizes s̃(ai)∈ (0; 1), and the goal is to 6nd a… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane. For the case that the disk… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2000
2000
The data broadcast problem is to find a schedule for broadcasting a given set of messages over multiple channels. The goal is to… (More)
  • figure 1
  • figure 2
Is this relevant?
2000
2000
Abst ract Given a set N of n terminals in the rst quadrant of the Euclidean plane E 2 , nd a minimum length directed tree rooted… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present a fully-polynomial randomized approximation scheme for computing the permanent of an arbitrary matrix with non… (More)
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We show that any polygonal subdivision in the plane can be converted into an “mguillotine” subdivision whose length is at most (1… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
  • figure 4.1
Is this relevant?
1999
1999
It is proved that everywhere-denseMin 2SAT and everywheredense Min Eq both have polynomial time approximation schemes. 
Is this relevant?