179 search results - page 5 / 36 » Polynomial Time Approximation Schemes for Geometric k-Cluste... |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
ESA
1999
Springer
14 years 2 days ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
DAM
2006
13 years 7 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...