@inproceedings{fe12d3fad1d1491a9516a806fc782709,

title = "Minimum Vertex Cover in Rectangle Graphs",

abstract = "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.",

author = "Reuven Bar-Yehuda and Dan Hermelin and Dror Rawitz",

year = "2010",

month = nov,

day = "19",

doi = "10.1007/978-3-642-15775-2_22",

language = "אנגלית",

isbn = "9783642157745",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "255--266",

editor = "Berg, {Mark de} and Meyer, {Ulrich }",

booktitle = "Algorithms – ESA 2010",

note = "null ; Conference date: 06-09-2010 Through 08-09-2010",

}