Dorit S. Hochbaum
Abstract
A unified and powerful approach is presented for devising polynomial approximation schemes for many strongly NP-complete problems. Such schemes consist of families of approximation algorithms for each desired performance bound on the relative error ε > Ο, with running time that is polynomial when ε is fixed. Though the polynomiality of these algorithms depends on the degree of approximation ε being fixed, they cannot be improved, owing to a negative result stating that there are no fully polynomial approximation schemes for strongly NP-complete problems unless NP = P.
The unified technique that is introduced here, referred to as the shifting strategy, is applicable to numerous geometric covering and packing problems. The method of using the technique and how it varies with problem parameters are illustrated. A similar technique, independently devised by B. S. Baker, was shown to be applicable for covering and packing problems on planar graphs.
- 1 BAKER, B. S.Approximation algorithms for NP-complete problems on planar graphs. In Proceed. ings of the 24th Annual IEEE Symposium on Foundations of Computer Science (Tucson, Ariz., Nov. 7-9). IEEE, New York, 1983, pp. 265-273.Google Scholar
- 2 BERMAN, F. D., LEIGHTON, F. T., AND SNYDER, L.Optimal tile salvage. Unpublished manuscript, 1982.Google Scholar
- 3 FOWLER, R. J., PATERSON, M. S., AND TANIMOTO, S. L.Optimal packing and covering in the plane are NP-complete. Inf. Proc. Lett. 12, 3 (June 1981), 133-137.Google Scholar
- 4 GAREY, M. R., AND JOHNSON, D. S.Computers and Intractability: A Guide to the Theory of NP- Completeness. Freeman, San Francisco, 1978. Google Scholar
- 5 HOCHBAUM, D. S., AND MAASS, W.Fast approximation schemes for geometric coveting and packing problems in robotics and VLSI. Unpublished manuscript, University of California, Berkeley, Calif., 1983.Google Scholar
- 6 JOHNSON, D. S."File NP-completeness column: An ongoing guide. ~ Algorithms 3, 2 (June 1982), 182-195.Google Scholar
- 7 TANIMOTO, S. L., AND FOWLER, R. J.Covering image subsets with patches. In Proceedings of the 5th International Conference on Pattern Recognition, 1980, pp. 835-839.Google Scholar
Index Terms
- Approximation schemes for covering and packing problems in image processing and VLSI
Recommendations
Hardness of approximation for orthogonal rectangle packing and covering problems
Bansal and Sviridenko [N. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, in: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2004, pp. 189-196] proved that there is ...
Hardness of Approximation for Strip Packing
Strip packing is a classical packing problem, where the goal is to pack a set of rectangular objects into a strip of a given width, while minimizing the total height of the packing. The problem has multiple applications, for example, in scheduling and ...
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 $$1+\gamma $$1+ź, for some arbitrarily small number $$\gamma > 0$$ź>0. For this problem, we ...
Comments