Discrete Mathematics
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Fast stabbing of boxes in high dimensions
Theoretical Computer Science
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
Independent set of intersection graphs of convex objects in 2D
Computational Geometry: Theory and Applications
Improved Results on Geometric Hitting Set Problems
Discrete & Computational Geometry
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
Jump number of two-directional orthogonal ray graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Intersection graphs of rectangles and segments
General Theory of Information Transfer and Combinatorics
| Hi-index | 0.00 |
In this note, we present a simple combinatorial factor 6 algorithm for approximating the minimum hitting set of a family R={R"1,...,R"n} of axis-parallel rectangles in the plane such that there exists an axis-monotone curve @c that intersects each rectangle in the family. The quality of the hitting set is shown by comparing it to the size of a packing (set of pairwise non-intersecting rectangles) that is constructed along, hence, we also obtain a factor 6 approximation for the maximum packing of R. In cases where the axis-monotone curve @c intersects the same side (e.g. the bottom side) of each rectangle in the family the approximation factor for hitting set and packing is 3.