Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

60

ESA
2010
Springer

favoriteEmaildiscussreport

273views Algorithms» more ESA 2010»

Minimum Vertex Cover in Rectangle Graphs

13 years 10 months ago

Minimum Vertex Cover in Rectangle Graphs

Download cs.haifa.ac.il

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

Real-time Traffic

Algorithms | ESA 2010 | Minimum Vertex Cover | Rectangle Families | Rectangles |

claim paper

Related Content

» Connected Vertex Covers in Dense Graphs

» An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

» On Approximating Minimum Vertex Cover for Graphs with Perfect Matching

» Hybrid evolutionary algorithms on minimum vertex cover for random graphs

» Approximating the minimum clique cover and other hard problems in subtree filament graphs

» Vertex and Edge Covers with Clustering Properties Complexity and Algorithms

» Crown reductions for the Minimum Weighted Vertex Cover problem

» The Minimum Generalized Vertex Cover Problem

» Optimization problems in multiple subtree graphs

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2010
Where	ESA
Authors	Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz

Comments (0)