Abstract
T. Rado conjectured in 1928 that if \({\mathcal S}\) is a finite set of axis-parallel squares in the plane, then there exists an independent subset \({\mathcal I}\subseteq\) \({\mathcal S}\) of pairwise disjoint squares, such that \({\mathcal I}\) covers at least 1/4 of the area covered by \({\mathcal S}\). 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 \({\mathcal S}\). The analogous question for other shapes and many similar problems have been considered by R. Rado in his three papers (1949, 1951 and 1968) on this subject. After 45 years (in 1973), Ajtai came up with a surprising example disproving T. Rado’s conjecture. We revisit Rado’s problem and present improved upper and lower bounds for squares, disks, convex sets, centrally symmetric convex sets, and others, as well as algorithmic solutions to these variants of the problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajtai, M.: The solution of a problem of T. Rado. Bulletin de l’Académie Polonaise des Sciences, Série des Sciences Math. Astr. et Phys. 21, 61–63 (1973)
Bereg, S., Dumitrescu, A., Jiang, M.: Maximum area independent set in disk intersection graphs. International Journal of Computational Geometry & Applications (to appear)
Chan, T.: Polynomial-time approximation schemes for packing and piercing fat objects. Journal of Algorithms 46, 178–189 (2003)
Croft, H.T., Falconer, K.J., Guy, R.K.: Unsolved Problems in Geometry. Springer, New York (1991)
Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM Journal on Computing 34, 1302–1323 (2005)
Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12, 133–137 (1981)
Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of ACM 32, 130–136 (1985)
Norlander, G.: A covering problem. Nordisk Mat. Tidskr. 6, 29–31 (1958)
Rado, R.: Some covering theorems (I). Proceedings of the London Mathematical Society 51, 241–264 (1949)
Rado, R.: Some covering theorems (II). Proceedings of the London Mathematical Society 53, 243–267 (1951)
Rado, R.: Some covering theorems (III). Journal of the London Mathematical Society 42, 127–130 (1968)
Rado, T.: Sur un problème relatif à un théorème de Vitali. Fund. Math. 11, 228–229 (1928)
Sokolin, A.: Concerning a problem of Rado. C.R. Acad. Sci. U.R.S.S (N.S.) 26, 871–872 (1940)
Yaglom, I.M., Boltyanskiĭ, V. G.: Convex Figures. Holt, Rinehart and Winston, New York (1961)
Zalgaller, V.A.: Remarks on a problem of Rado. Matem. Prosveskcheric 5, 141–148 (1960)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bereg, S., Dumitrescu, A., Jiang, M. (2008). On Covering Problems of Rado. In: Gudmundsson, J. (eds) Algorithm Theory – SWAT 2008. SWAT 2008. Lecture Notes in Computer Science, vol 5124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69903-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-69903-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69900-2
Online ISBN: 978-3-540-69903-3
eBook Packages: Computer ScienceComputer Science (R0)