In computer science, a polynomial-time approximation scheme (PTAS) is a type of approximation algorithm for optimization problems (most often, NP… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Daniel Stefankovic, Santosh Vempala, Eric Vigoda
- SIAM J. Comput.
- 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)

Is this relevant?

2002

2002

- Klaus Jansen
- Algorithmica
- 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

- Klaus Jansen, Roberto Solis-Oba
- ISAAC
- 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

- Thomas Erlebach, Klaus Jansen, Eike Seidel
- SODA
- 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)

Is this relevant?

2000

2000

- Claire Mathieu, Nicolas Schabanel, Neal E. Young
- STOC
- 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)

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

- Mark Jerrum, Alistair Sinclair, Eric Vigoda
- STOC
- 2000

We present a fully-polynomial randomized approximation scheme for computing the permanent of an arbitrary matrix with non… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Joseph S. B. Mitchell
- SIAM J. Comput.
- 1999

We show that any polygonal subdivision in the plane can be converted into an “mguillotine” subdivision whose length is at most (1… (More)

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?