Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
APA
Anil Kumar, V. S., & Ramesh, H. (2003). Covering rectilinear polygons with axis-parallel rectangles. SIAM Journal on Computing, 32(6), 1509–1541. https://doi.org/10.1137/S0097539799358835
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free