Minimum vertex cover in rectangle graphs

Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz

Research output: Contribution to journalArticlepeer-review

5 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 R where R 1R2 is connected for every pair of rectangles R 1,R2εR. 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 in a novel way.

Original languageEnglish
Pages (from-to)356-364
Number of pages9
JournalComputational Geometry: Theory and Applications
Issue number6-7
StatePublished - 1 Aug 2011
Externally publishedYes


  • Approximation algorithms
  • Arrangement graphs
  • Axis-parallel rectangles
  • Intersection graphs
  • Pseudo-disks

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'Minimum vertex cover in rectangle graphs'. Together they form a unique fingerprint.

Cite this