Approximation schemes for covering and packing problems in image processing and VLSI

Approximation schemes for covering and packing problems in image processing and VLSI (1985)

Cached

Download Links

[www.cs.du.edu]

Other Repositories/Bibliography

DBLP

by Dorit S. Hochbaum , Wolfgang Maass

Venue:	J. ACM
Citations:	158 - 0 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Approximation schemes for covering and packing problems in image processing and VLSI	INFERENCE
AUTHOR NAME	Dorit S. Hochbaum	SVM HeaderParse 0.2
AUTHOR AFFIL	University of California	SVM HeaderParse 0.2
AUTHOR ADDR	Berkeley, California	SVM HeaderParse 0.2
AUTHOR NAME	Wolfgang Maass	SVM HeaderParse 0.2
AUTHOR AFFIL	University of California	SVM HeaderParse 0.2
AUTHOR ADDR	Berkeley, California	SVM HeaderParse 0.2
ABSTRACT	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.	SVM HeaderParse 0.2
YEAR	1985	INFERENCE
VENUE	J. ACM	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	130--136	INFERENCE
VOLUME	32	INFERENCE
CITATIONS	6 found	ParsCit 1.0