# On Covering Problems of Rado

@article{Bereg2009OnCP,
author={Sergey Bereg and Adrian Dumitrescu and Minghui Jiang},
journal={Algorithmica},
year={2009},
volume={57},
pages={538-561}
}
• Published 2009
• Mathematics, Computer Science
• Algorithmica
T. Rado conjectured in 1928 that if ℱ is a finite set of axis-parallel squares in the plane, then there exists an independent subset ℐ⊆ℱ of pairwise disjoint squares, such that ℐ covers at least 1/4 of the area covered by ℱ. He also showed that the greedy algorithm (repeatedly choose the largest square disjoint from those previously selected) finds an independent set of area at least 1/9 of the area covered by ℱ. The analogous question for other shapes and many similar problems have been… Expand
12 Citations

#### Figures, Tables, and Topics from this paper

Packing Unit Disks
Given a set of unit disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the disks? Richard Rado conjectured 1/4 and proved 1/4.41. InExpand
A better lower bound for Lower-Left Anchored Rectangle Packing
• Computer Science
• ArXiv
• 2021
This paper improves the best known lower bound on the total area that can be covered from 0.09121 to 0.1039 and adds an upper bound of 3/4 on the approximation ratio for a natural class of greedy algorithms that includes the one that achieves the lower bound. Expand
On the Complexity of Anchored Rectangle Packing
This work first studies the Center-Anchored Rectangle Packing (CARP) problem, where rectangles are anchored in their center, and proves NP-hardness and provides a PTAS, which applies to any ARP problem where the anchor lies in the interior of the rectangles. Expand
A list of problems in Plane Geometry with simple statement that remain unsolved
This article contains a short and entertaining list of unsolved problems in Plane Geometry. Their statement may seem naive and can be understood at an elementary level. But their solutions haveExpand
Systems of distant representatives in euclidean space
• Computer Science, Mathematics
• SoCG '13
• 2013
Given a finite family of sets, Hall's classical marriage theorem provides a necessary and sufficient condition for the existence of a system of distinct representatives for the sets in the family, and these methods are constructive and lead to efficient algorithms for computing such representatives. Expand
Disjoint empty disks supported by a point set
• Mathematics
• 2012
For a planar point-set P, let D(P) be the minimum number of pairwise-disjoint empty disks such that each point in P lies on the boundary of some disk. Further define D(n) as the maximum of D(P) overExpand
Piercing Translates and Homothets of a Convex Body
• Mathematics, Computer Science
• Algorithmica
• 2010
The methods for obtaining upper bounds are constructive and lead to efficient constant-factor approximation algorithms for finding a minimum-cardinality point set that pierces a set of translates or homothets of a convex body. Expand
Anchored Rectangle and Square Packings
• Computer Science, Mathematics
• SoCG
• 2016
It is proved that a simple greedy strategy achieves a 9/47-approximation for anchored square packings, and 1/3 for lower-left anchoredsquare packings when reduced to maximum weight independent set (MWIS). Expand
Anchored rectangle and square packings
• Mathematics, Computer Science
• Discret. Optim.
• 2017
It is proved that a simple greedy strategy achieves a 9 ∕ 47 -approximation for anchoredsquare packings, and 1 ∕ 3 for lower-left anchored square packings. Expand
Maximum Area Independent Sets in Disk Intersection Graphs
• Mathematics, Computer Science
• Int. J. Comput. Geom. Appl.
• 2010
Quantitative bounds on the maximum total area of an independent set relative to the union area and Practical constant-ratio approximation algorithms for finding anindependent set with a large total area relative toThe union area are obtained. Expand

#### References

SHOWING 1-10 OF 39 REFERENCES
Optimal Packing and Covering in the Plane are NP-Complete
• Computer Science
• Inf. Process. Lett.
• 1981
This paper proves that even severely restricted instances of packing and covering problems remain NP-hard in two or more dimensions, and helps to fill the gap by showing that some very constrained intersection graph problems in two dimensions are not very constrained. Expand
A SOLUTION TO A PROBLEM OF
• 2007
We announce a solution to a multiplicity problem for nests posed by J. R. Ringrose approximately twenty years ago. This also answers a question posed by R. V. Kadison and I. M. Singer, andExpand
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
• Mathematics, Computer Science
• SIAM J. Comput.
• 2005
These are the first known PTASs for $\mathcal{NP}$-hard optimization problems on disk graphs based on a novel recursive subdivision of the plane that allows applying a shifting strategy on different levels simultaneously, so that a dynamic programming approach becomes feasible. Expand
Approximation schemes for covering and packing problems in image processing and VLSI
• Mathematics, Computer Science
• JACM
• 1985
The unified technique that is introduced here, referred to as the shifting strategy, is applicable to numerous geometric covering and packing problems and how it varies with problem parameters is illustrated. Expand
Research problems in discrete geometry
• Computer Science
• 2005
This chapter discusses 100 Research Problems in Discrete Geometry from the Facsimile edition of the World Classics in Mathematics Series, vol. Expand
Unsolved Problems In Geometry
• Computer Science
• 1991
A monograph on geometry, each section in the book describes a problem or a group of related problems, capable of generalization of variation in many directions. Expand
Maximum Area Independent Sets in Disk Intersection Graphs
• Mathematics, Computer Science
• Int. J. Comput. Geom. Appl.
• 2010
Quantitative bounds on the maximum total area of an independent set relative to the union area and Practical constant-ratio approximation algorithms for finding anindependent set with a large total area relative toThe union area are obtained. Expand
Computational geometry: an introduction
• Computer Science, Mathematics
• 1985
This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry. Expand
Combinatorial geometry
• Mathematics, Computer Science
• Wiley-Interscience series in discrete mathematics and optimization
• 1995
\indent This beautiful discipline emerged from number theory after the fruitful observation made by Minkowski (1896) that many important results in diophantine approximation (and in some otherExpand
CRC standard mathematical tables and formulae; 30th edition
Numbers and Elementary Mathematics Proofs without words Constants Special numbers Number theory Series and products Algebra Elementary algebra Polynomials Vector algebra Linear and matrix algebraExpand