Polynomial-time approximation scheme
Semantic Scholar uses AI to extract papers important to this topic.
Given n elements with nonnegative integer weights w1, . . . , wn and an integer capacity C, we consider the counting version of… (More)
We present a surprising result that the traveling salesman problem has a polynomial-time approximation scheme when the distances… (More)
A malleable parallel task is one whose execution time is a function of the number of (identical) processors allotted to it. We… (More)
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)
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)
The data broadcast problem is to find a schedule for broadcasting a given set of messages over multiple channels. The goal is to… (More)
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)
We present a fully-polynomial randomized approximation scheme for computing the permanent of an arbitrary matrix with non… (More)
We show that any polygonal subdivision in the plane can be converted into an “mguillotine” subdivision whose length is at most (1… (More)
It is proved that everywhere-denseMin 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.