Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Rectangle covers revisited computationally
Journal of Experimental Algorithmics (JEA)
Fast exact and heuristic methods for role minimization problems
Proceedings of the 13th ACM symposium on Access control models and technologies
A partition-based heuristic for translational box covering
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Epsilon nets and union complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Weighted geometric set cover via quasi-uniform sampling
Proceedings of the forty-second ACM symposium on Theory of computing
Parsimonious rule generation for a nature-inspired approach to self-assembly
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Rectangle covers revisited computationally
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
We give an $O(\sqrt{\log n})$ factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation algorithm for this problem with an $o(\log n)$ approximation factor.