Sciweavers

ESA
2010
Springer

Minimum Vertex Cover in Rectangle Graphs

13 years 10 months ago
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
Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2010
Where ESA
Authors Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
Comments (0)