{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:00:59Z","timestamp":1743030059358,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699002"},{"type":"electronic","value":"9783540699033"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69903-3_27","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"294-305","source":"Crossref","is-referenced-by-count":0,"title":["On Covering Problems of Rado"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Dumitrescu","sequence":"additional","affiliation":[]},{"given":"Minghui","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","first-page":"61","volume":"21","author":"M. Ajtai","year":"1973","unstructured":"Ajtai, M.: The solution of a problem of T. Rado. Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences, S\u00e9rie des Sciences Math. Astr. et Phys.\u00a021, 61\u201363 (1973)","journal-title":"Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences, S\u00e9rie des Sciences Math., Astr. et Phys."},{"key":"27_CR2","unstructured":"Bereg, S., Dumitrescu, A., Jiang, M.: Maximum area independent set in disk intersection graphs. International Journal of Computational Geometry & Applications (to appear)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/S0196-6774(02)00294-8","volume":"46","author":"T. Chan","year":"2003","unstructured":"Chan, T.: Polynomial-time approximation schemes for packing and piercing fat objects. Journal of Algorithms\u00a046, 178\u2013189 (2003)","journal-title":"Journal of Algorithms"},{"key":"27_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0963-8","volume-title":"Unsolved Problems in Geometry","author":"H.T. Croft","year":"1991","unstructured":"Croft, H.T., Falconer, K.J., Guy, R.K.: Unsolved Problems in Geometry. Springer, New York (1991)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T. Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM Journal on Computing\u00a034, 1302\u20131323 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters\u00a012, 133\u2013137 (1981)","journal-title":"Information Processing Letters"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of ACM\u00a032, 130\u2013136 (1985)","journal-title":"Journal of ACM"},{"key":"27_CR8","first-page":"29","volume":"6","author":"G. Norlander","year":"1958","unstructured":"Norlander, G.: A covering problem. Nordisk Mat. Tidskr.\u00a06, 29\u201331 (1958)","journal-title":"Nordisk Mat. Tidskr."},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1112\/plms\/s2-51.4.241","volume":"51","author":"R. Rado","year":"1949","unstructured":"Rado, R.: Some covering theorems (I). Proceedings of the London Mathematical Society\u00a051, 241\u2013264 (1949)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1112\/plms\/s2-53.4.243","volume":"53","author":"R. Rado","year":"1951","unstructured":"Rado, R.: Some covering theorems (II). Proceedings of the London Mathematical Society\u00a053, 243\u2013267 (1951)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1112\/jlms\/s1-43.1.127","volume":"42","author":"R. Rado","year":"1968","unstructured":"Rado, R.: Some covering theorems (III). Journal of the London Mathematical Society\u00a042, 127\u2013130 (1968)","journal-title":"Journal of the London Mathematical Society"},{"key":"27_CR12","doi-asserted-by":"crossref","first-page":"228","DOI":"10.4064\/fm-11-1-228-229","volume":"11","author":"T. Rado","year":"1928","unstructured":"Rado, T.: Sur un probl\u00e8me relatif \u00e0 un th\u00e9or\u00e8me de Vitali. Fund. Math.\u00a011, 228\u2013229 (1928)","journal-title":"Fund. Math."},{"key":"27_CR13","first-page":"871","volume":"26","author":"A. Sokolin","year":"1940","unstructured":"Sokolin, A.: Concerning a problem of Rado. C.R. Acad. Sci. U.R.S.S (N.S.)\u00a026, 871\u2013872 (1940)","journal-title":"C.R. Acad. Sci. U.R.S.S. (N.S.)"},{"key":"27_CR14","unstructured":"Yaglom, I.M., Boltyanski\u012d, V. G.: Convex Figures. Holt, Rinehart and Winston, New York (1961)"},{"key":"27_CR15","first-page":"141","volume":"5","author":"V.A. Zalgaller","year":"1960","unstructured":"Zalgaller, V.A.: Remarks on a problem of Rado. Matem. Prosveskcheric\u00a05, 141\u2013148 (1960)","journal-title":"Matem. Prosveskcheric"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69903-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T06:53:27Z","timestamp":1715237607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69903-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540699002","9783540699033"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69903-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}