Minimum Vertex Cover in Rectangle Graphs

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 R where R1 \ R2 is connected for every pair of rectangles R1, R2 R. The

• Type: Conference
• Year: 2010
• Where: ESA
• Authors: Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
• Keywords: Algorithms, ESA 2010, Minimum Vertex Cover, Rectangle Families, Rectangles