Covering Rectilinear Polygons with Axis-Parallel Rectangles

We give an O( 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. Key words. approximation algorithms, covering polygons AMS subject classifications. 52C15, 68W25, 68W40 DOI. 10.1137/S0097539799358835

• Type: Conference
• Year: 1999
• Where: STOC
• Authors: V. S. Anil Kumar, H. Ramesh
• Keywords: Algorithms, Approximation Algorithms, Factor Approximation Algorithm, STOC 1999, Time Approximation Algorithm