Lehilton L. C. Pedrosa

Polynomial-Time Approximation Schemes for Circle Packing Problems

We consider the problem of packing a set of circles into a minimum number of unit square bins. We give an asymptotic approximation scheme (APTAS) when we have resource augmentation in one dimension, that is, we may use bins of height 1 + γ, for some small γ > 0. As a corollary, we also obtain an APTAS for the circle strip packing problem, whose objective is to pack a set of circles into a strip of unit width and minimum height. These are the first approximation schemes for these problems. Our algorithm is based on novel ideas of iteratively separating small and large items, and may be extended to more general packing problems. For example, we also obtain APTAS’s for the corresponding problems of packing d-dimensional spheres under the L p -norm.

Polynomial-Time Approximation Schemes for Circle and Other Packing Problems

We consider the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augmented bins of height

Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center

1+\gamma

Integrated Supply Chain Management via Randomized Rounding

1+γ, for some arbitrarily small number

A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems

\gamma > 0

A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems.

γ>0. For this problem, we obtain an asymptotic approximation scheme (APTAS) that is polynomial on