Minimum Vertex Cover in Rectangle Graphs

DOI10.1007/978-3-642-15775-2_22zbMath1287.05143OpenAlexW2097525156MaRDI QIDQ3586467

Danny Hermelin, Dror Rawitz, Reuven Bar Yehuda

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.755.7881

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Coloring and Maximum Independent Set of Rectangles

This page was built for publication: Minimum Vertex Cover in Rectangle Graphs