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

@article{Hochbaum1985ApproximationSF,
  title={Approximation schemes for covering and packing problems in image processing and VLSI},
  author={D. Hochbaum and W. Maass},
  journal={J. ACM},
  year={1985},
  volume={32},
  pages={130-136}
}
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… Expand
Approximation schemes for geometric problems
This thesis is clevoted to geometric optimization problems of the fol¬ lowing kind: given a set of points P C _fd1 we wish to compute a certain straight-linograph on P with minimum length, such as aExpand
Algorithms for Geometric Covering Problems
Motivated by the applications in facility location, VLSI design, image processing and motion planning, geometric covering problems have been studied extensively in the literature. In this thesisExpand
An Algorithmic Framework for Solving Geometric Covering Problems - with Applications
TLDR
This paper proposes an algorithmic framework that gives an approximation algorithm for the covering problem at hand, provided that its prerequisites are satisfied and presents two new polynomial-time approximation schemes (PTAS) for the problems of covering with disks in the presence of polygonal obstacles and covering with sectors. Expand
A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
TLDR
The authors' approximation schemes for hierarchically specified unit disk graphs along with the results in [MHSR94] are the first approximation schemes in the literature for natural PSPACE-hard optimization problems. Expand
Approximation Schemes for Covering and Packing in the Streaming Model
TLDR
This paper revisits the shifting strategy in the context of the streaming model and develops a streaming-friendly shifting strategy, which is combined with the shifting coreset method introduced by Fonseca et al., to obtain streaming algorithms for various graph properties of unit disc graphs. Expand
Covering Problems via Structural Approaches
The minimum set cover problem is, without question, among the most ubiquitous and well-studied problems in computer science. Its theoretical hardness has been fully characterized—logarithmicExpand
Approximation Schemes for Independent Set and Sparse Subsets of Polygons
TLDR
Surprisingly, the (1+ε)-approximation algorithm can be extended to the problem of computing the maximum cardinality subset of the given set of polygons whose intersection graph fulfills some sparsity condition, and it is shown that one can approximate the maximum subset of polygon such that the intersection graph of the subset is planar or does not contain a cycle of length 4. Expand
Beyond Baker's Technique
TLDR
This paper proposes a unified framewo rk to formulate the optimization problems where the local constraints of these problems are encoded by functions attached on the vertices, and generalizes Baker’s technique and many existing methods of graph decomposition. Expand
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
TLDR
A polynomial-time algorithm to pack a set of m disjoint disks of radius α into ρ such that no disk in B intersects a disk in , where m is the maximum number of unit disks that can be packed. Expand
Approximation Algorithms for Partial Covering Problems
TLDR
A polynomial-time approximation scheme for k-vertex cover on planar graphs, and for covering points in Rd by disks is obtained, and an approximation of 4/3 is obtained for instances where each set has cardinality at most three. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 11 REFERENCES
Approximation algorithms for NP-complete problems on planar graphs
  • B. Baker
  • Mathematics, Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
TLDR
A general technique that can be used to obtain approximation algorithms for various NP-complete problems on planar graphs, which includes maximum independent set, maximum tile salvage, partition into triangles, maximum H-matching, minimum vertex cover, minimum dominating set, and minimum edge dominating set. Expand
Optimal Packing and Covering in the Plane are NP-Complete
TLDR
This paper proves that even severely restricted instances of packing and covering problems remain NP-hard in two or more dimensions, and helps to fill the gap by showing that some very constrained intersection graph problems in two dimensions are not very constrained. Expand
Optimal Tile Salvage.
Abstract : A map is a tiling of a finite region of the plane with unit squares such that some tiles have been removed. The optimal x x y-Tile Salvage Problem is: Given a map, find the maximum numberExpand
The NP-Completeness Column: An Ongoing Guide
  • D. Johnson
  • Mathematics, Computer Science
  • J. Algorithms
  • 1986
TLDR
This is the fourteenth edition of a quarterly column that provides continuing coverage of new developments in the theory of NP-completeness, and readers who have results they would like mentioned (NP-hardness, PSPACE- hardness, polynomialtime-solvability, etc.), or open problems they wouldlike publicized, should send them to David S. Johnson. Expand
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledgeExpand
Fast approximation schemes for geometric covering and packing problems in robotics and VLSI
  • Unpublished manuscript,
  • 1983
Fast approximation schemes for geometric covering and packing problems in robotics and VLSI. Unpublished manuscript
  • Fast approximation schemes for geometric covering and packing problems in robotics and VLSI. Unpublished manuscript
  • 1983
RECEIVED AUGUST
  • RECEIVED AUGUST
  • 1983
The NP-Completeness Column: An Ongoing Guide
COVERING IMAGE SUBSETS WITH PATCHES.
...
1
2
...