{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:41:13Z","timestamp":1725565273327},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220572"},{"type":"electronic","value":"9783540247678"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24767-8_15","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T00:45:04Z","timestamp":1284165904000},"page":"137-146","source":"Crossref","is-referenced-by-count":1,"title":["On the Time Complexity of Rectangular Covering Problems in the Discrete Plane"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Porschen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/1097-0037(200010)36:3<147::AID-NET1>3.0.CO;2-M","volume":"36","author":"E.M. Arkin","year":"2000","unstructured":"Arkin, E.M., Hassin, R.: Minimum-Diameter Covering Problems. Networks\u00a036, 147\u2013155 (2000)","journal-title":"Networks"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1137\/S1064827596297562","volume":"19","author":"P. Bastian","year":"1998","unstructured":"Bastian, P.: Load Balancing for Adaptive Multigrid Methods. SIAM Journal on Scientific Computing\u00a019, 1303\u20131321 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bespamyatnikh, S., Segal, M.: Covering a set of points by two axis-parallel boxes (1999) (preprint)","DOI":"10.1016\/S0020-0190(00)00093-4"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0012-365X(89)90080-0","volume":"75","author":"E. Boros","year":"1989","unstructured":"Boros, E., Hammer, P.L.: On Clustering Problems with Connected Optima in Euclidean Spaces. Discrete Mathematics\u00a075, 81\u201388 (1989)","journal-title":"Discrete Mathematics"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/net.10058","volume":"41","author":"F.C. Calheiros","year":"2003","unstructured":"Calheiros, F.C., Lucena, A., de Souza, C.C.: Optimal Rectangular Partitions. Networks\u00a041, 51\u201367 (2003)","journal-title":"Networks"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Culberson, J.C., Reckhow, R.A.: Covering Polygons is Hard. In: Proceedings of the twenty-ninth IEEE Symposium on Foundations of Computer Science, pp. 601\u2013611 (1988)","DOI":"10.1109\/SFCS.1988.21976"},{"key":"15_CR7","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/0196-6774(91)90013-O","volume":"12","author":"J. Hershberger","year":"1991","unstructured":"Hershberger, J., Suri, S.: Finding Tailored Partitions. Journal of Algorithms\u00a012, 431\u2013463 (1991)","journal-title":"Journal of Algorithms"},{"volume-title":"Approximation Algorithms for NP-hard problems","year":"1996","key":"15_CR9","unstructured":"Hochbaum, D.S. (ed.): Approximation Algorithms for NP-hard problems. PWS Publishing, Boston (1996)"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s004540010014","volume":"23","author":"M.N. Kolountzakis","year":"2000","unstructured":"Kolountzakis, M.N.: On the Structure of Multiple Translational Tilings by Polygonal Regions. Discrete Comput. Geom.\u00a023, 537\u2013553 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"15_CR11","first-page":"419","volume":"43","author":"B. Monien","year":"1981","unstructured":"Monien, B., Speckenmeyer, E., Vornberger, O.: Upper Bounds for Covering Problems. Methods of Operations Research\u00a043, 419\u2013431 (1981)","journal-title":"Methods of Operations Research"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Porschen, S.: On Covering Z-Grid Points by Rectangles. ENDM\u00a08 (2001)","DOI":"10.1016\/S1571-0653(05)80086-1"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0196-6774(91)90009-N","volume":"12","author":"S.S. Skiena","year":"1991","unstructured":"Skiena, S.S.: Probing Convex Polygons with Half-Planes. Journal of Algorithms\u00a012, 359\u2013374 (1991)","journal-title":"Journal of Algorithms"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1006\/jagm.2000.1109","volume":"37","author":"A. Smith","year":"2000","unstructured":"Smith, A., Suri, S.: Rectangular Tiling in Multidimensional Arrays. Journal of Algorithms\u00a037, 451\u2013467 (2000)","journal-title":"Journal of Algorithms"},{"key":"15_CR15","unstructured":"Tanimoto, S.L., Fowler, R.J.: Covering Image Subsets with Patches. In: Proceedings of the fifty-first International Conference on Pattern Recognition, pp. 835\u2013839 (1980)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24767-8_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:55:22Z","timestamp":1605761722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24767-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220572","9783540247678"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24767-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}