On Covering Problems of Rado

DOI10.1007/978-3-540-69903-3_27MaRDI QIDQ3512467zbMATH OpenOpenAlexFDO

Authors Sergey Bereg, Adrian Dumitrescu, Minghui Jiang

Publication date 15 July 2008

Published in Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69903-3_27

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• On covering problems of Rado
• Covering a disk by disks
• ON-LINE COVERING OF THE UNIT SQUARE BY A SEQUENCE OF CONVEX BODIES
• Covering point sets with two disjoint disks or squares

Cites work

• scientific article; zbMATH DE number 3149558 (Why is no real title available?)
• scientific article; zbMATH DE number 3160756 (Why is no real title available?)
• scientific article; zbMATH DE number 3234208 (Why is no real title available?)
• scientific article; zbMATH DE number 3408456 (Why is no real title available?)
• Approximation schemes for covering and packing problems in image processing and VLSI
• Maximum area independent sets in disk intersection graphs
• Optimal packing and covering in the plane are NP-complete
• Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
• Polynomial-time approximation schemes for packing and piercing fat objects
• Some Covering Theorems (I)
• Some Covering Theorems (II)
• Some Covering Theorems (III)
• Unsolved problems in geometry

Cited in

(7)

• On covering problems of Rado
• The ideal view on Rackoff's coverability technique
• It’s Hard to Color Antirectangles
• Solvability of Rado systems in \(D\)-sets
• Packing, hitting, and colouring squares
• On covering and coloring problems for rook domains
• Greed is (Sometimes) Not Enough

This page was built for publication: On Covering Problems of Rado

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512467)