{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:02Z","timestamp":1725664502804},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620341"},{"type":"electronic","value":"9783540496311"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_44","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:31:18Z","timestamp":1330277478000},"page":"135-146","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Close approximations of minimum rectangular coverings"],"prefix":"10.1007","author":[{"given":"Christos","family":"Levcopoulos","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"12_CR1","unstructured":"P. Berman and B. DasGupta, Approximating the Rectilinear Polygon Cover Problems, Proc. 4th Canadian Conf. Computational Geometry, pp.229\u2013235, 1992."},{"key":"12_CR2","unstructured":"B.M. Chazelle, Computational Geometry and Convexity, Ph.D. Thesis, Carnegie-Mellon Univ., Dept. Comput. Sci., 1980."},{"key":"12_CR3","unstructured":"Carmen, T.H., Leiserson, C.E. and Rivest, R.L., Introduction to Algorithms, MIT Press, 1990."},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jagm.1994.1025","volume":"17","author":"J.C. Culberson","year":"1994","unstructured":"J.C. Culberson and R.A. Reckhow, Covering Polygon is Hard, Journal of Algorithms, 17:2\u201344, 1994.","journal-title":"Journal of Algorithms"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"D. Franzblau and D. Kleitman, An Algorithm for Constructing Regions with Rectangles, In Proc. 16th Ann. ACM Symp. Theory of Comp., pp. 167\u2013174, 1984.","DOI":"10.1145\/800057.808678"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"C. Levcopoulos and J. Gudmundsson, Close Approximation of Minimum Rectangular Coverings, LU-CS-TR 96-164, Dept. of Comp. Sci., Lund University, 1996.","DOI":"10.1007\/3-540-62034-6_44"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"A. Heged\u00fcs, Algorithms for covering polygons by rectangles, Computer Aided Design, vol. 14, no 5, 1982.","DOI":"10.1016\/0010-4485(82)90104-X"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"J.M. Keil, Minimally Covering a Horizontally Convex Orthogonal Polygon, Proceedings 2nd Annual Symposium on Computational Geometry, pp.43\u201351, 1986.","DOI":"10.1145\/10515.10520"},{"key":"12_CR9","unstructured":"C. Levcopoulos, A Fast Heuristic for Covering Polygons by Rectangles, Proceedings FCT'85, Cottbus, GDR, 1985 (LNCS 199, Springer-Verlag)."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"C. Levcopoulos, Improved Bounds for Covering General Polygons with Rectangles, Proc. 7th Conf. on FST&TCS, Pune, India, 1987 (LNCS 287, Springer-Verlag).","DOI":"10.1007\/3-540-18625-5_45"},{"key":"12_CR11","volume-title":"PhD thesis","author":"L. Monk","year":"1975","unstructured":"L. Monk, Elementary-recursive Decision Procedures, PhD thesis, University of California, Berkeley, 1975."},{"key":"12_CR12","volume-title":"Report JHU-EE 82-1","author":"J. O'Rourke","year":"1982","unstructured":"J. O'Rourke, The decidability of Covering by Convex Polygons, Report JHU-EE 82-1, Dept. Elect. Engrg. Comp. Sci., Johns Hopkins Univ., Baltimore, MD,1982."},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TIT.1983.1056648","volume":"IT-29","author":"J. O'Rourke","year":"1983","unstructured":"J. O'Rourke and K.J. Supowit, Some NP-hard Polygon Decomposition Problems, IEEE Transactions on Information Theory, vol. IT-29, pp.181\u2013190, 1983.","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"F.P. Preparata and M.I. Shamos, Computational Geometry, New York, Springer-Verlag, 1985."},{"key":"12_CR15","unstructured":"M. Yamashita, T. Ibaraki and N. Honda, The minimum number cover problem of a rectilinear region by rectangles, EATCS'84."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:29:41Z","timestamp":1578508181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_44"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}