Minimum Vertex Cover in Rectangle Graphs

Reuven Bar-Yehuda, Dan Hermelin, Dror Rawitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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.

Original languageEnglish GB
Title of host publicationAlgorithms – ESA 2010
Subtitle of host publication18th Annual European Symposium, Proceedings, Part I
EditorsMark de Berg, Ulrich Meyer
Number of pages12
StatePublished - 19 Nov 2010
Externally publishedYes
Event18th Annual European Symposium on Algorithms, ESA 2010 - Liverpool, United Kingdom
Duration: 6 Sep 20108 Sep 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
ISSN (Print)0302-9743


Conference18th Annual European Symposium on Algorithms, ESA 2010
Country/TerritoryUnited Kingdom

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Minimum Vertex Cover in Rectangle Graphs'. Together they form a unique fingerprint.

Cite this