TY - GEN

T1 - Minimum vertex cover in rectangle graphs

AU - Bar-Yehuda, Reuven

AU - Hermelin, Danny

AU - Rawitz, Dror

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=78249258390&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-15775-2_22

DO - 10.1007/978-3-642-15775-2_22

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:78249258390

SN - 3642157742

SN - 9783642157745

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 255

EP - 266

BT - Algorithms, ESA 2010 - 18th Annual European Symposium, Proceedings

T2 - 18th Annual European Symposium on Algorithms, ESA 2010

Y2 - 6 September 2010 through 8 September 2010

ER -