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

Content Provider	ACM Digital Library
Author	Hochbaum, Dorit S. Maass, Wolfgang
Copyright Year	1985
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 ε > &Ogr;, 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.
Starting Page	130
Ending Page	136
Page Count	7
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/2455.214106
Journal	Journal of the ACM (JACM)
Volume Number	32
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1985-01-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Linear-time approximation schemes for clustering problems in any dimensions

P-Complete Approximation Problems

Approximation Algorithms for Some Postman Problems

The VLSI Complexity of Selected Graph Problems

On the Covering and Reduction Problems for Context-Free Grammars

A Stochastic Approximation Method for Optimization Problems

New Algorithms for Bin Packing

Optimal VLSI circuits for sorting

On the Sum-of-Squares algorithm for bin packing

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

Similar Documents

Linear-time approximation schemes for clustering problems in any dimensions

P-Complete Approximation Problems

Approximation Algorithms for Some Postman Problems

The VLSI Complexity of Selected Graph Problems

On the Covering and Reduction Problems for Context-Free Grammars

A Stochastic Approximation Method for Optimization Problems

New Algorithms for Bin Packing

Optimal VLSI circuits for sorting

On the Sum-of-Squares algorithm for bin packing

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