DMCA
Approximation schemes for covering and packing problems in image processing and VLSI (1985)
Cached
Download Links
- [www.cs.du.edu]
- [www.ece.mtu.edu]
- [web.cs.du.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | J. ACM |
| Citations: | 248 - 0 self |
BibTeX
@ARTICLE{Hochbaum85approximationschemes,
author = {Dorit S. Hochbaum and Wolfgang Maass},
title = {Approximation schemes for covering and packing problems in image processing and VLSI},
journal = {J. ACM},
year = {1985},
volume = {32},
number = {1},
pages = {130--136}
}
Share
 |
 |
 |
 |
||
OpenURL
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 c> 0, with running time that is polynomial when c is fixed. Thougb the polynomiality of these algorithms depends on the degree of approximation e 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.
Keyphrases
approximation scheme image processing np-complete problem polynomial approximation scheme problem parameter unified technique algorithm depends planar graph numerous geometric covering desired performance bound similar technique powerful approach packing problem relative error running time approximation algorithm negative result
