We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families ℛ where R1\R2 is connected for every pair of rectangles R 1, R2 ∈ ℛ. This algorithm extends to intersection graphs of pseudo-disks. The second algorithm achieves a factor of (1.5 + ε) in general rectangle families, for any fixed ε > 0, and works also for the weighted variant of the problem. Both algorithms exploit the plane properties of axis-parallel rectangles. © 2010 Springer-Verlag.
CITATION STYLE
Bar-Yehuda, R., Hermelin, D., & Rawitz, D. (2010). Minimum vertex cover in rectangle graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6346 LNCS, pp. 255–266). https://doi.org/10.1007/978-3-642-15775-2_22
Mendeley helps you to discover research relevant for your work.