Approximation schemes for covering and packing problems in robotics and vlsi
The approach described in this paper, the shifting strategy, has proved useful in a large variety of contexts. Via the use of this approach we were able to derive algorithms that are the best possible in the sense that the exponential dependence on 1/ɛ cannot be removed unless NP=P. We also note that all other polynomial approximation schemes that we are familiar with rely on dynamic programming. The technique we introduced is an alternative to dynamic programming for the construction of polynomial approximation schemes for strongly NP-complete problems.
Unable to display preview. Download preview PDF.
- John J. Bartholdi III, "A Guaranteed-Accuracy Round-Off Algorithm for Cyclic Scheduling and Set Covering," Operations Research, Vol. 29, No. 3 (1981).Google Scholar
- F. D. Berman, F. T. Leighton and L. Snyder, "Optimal Tile Salvage," unpublished manuscript (1982).Google Scholar
- R. J. Fowler, M. S. Paterson, and S. L. Tanimoto, "Optimal Packing and Covering in the Plane Are NP-Complete," Inform. Process. Lett., 12 (1981), 133–137.Google Scholar
- M. R. Gary and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman (1978).Google Scholar
- D. S. Hochbaum and W. Maass, "Fast Approximation Algorithms for the Robot Placement Problem," manuscript, U.C. Berkeley (1983), submitted.Google Scholar
- D. S. Hochbaum and W. Maass, "Approximation Algorithms for Covering and Packing Problems in Image Processing and VLSI," manuscript, U.C. Berkeley (May 1983), submitted.Google Scholar
- D. S. Johnson, "The NP-Completeness Column: An Ongoing Guide," Journal of Algorithms, 3, 182–195 (1982).Google Scholar
- W. Maass, "On the Complexity of Computing Optimal Positions for Industrial Robots," U.C. Berkeley, manuscript, submitted.Google Scholar
- S. L. Tanimoto and R. J. Fowler, "Covering Image Subsets with Patches," Proc. 5th Inter. Conf. on Pattern Recognition, (1980) 835–839.Google Scholar