{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:13:35Z","timestamp":1761621215612},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"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":["Combinatorica"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00493-015-3006-1","type":"journal-article","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T18:15:27Z","timestamp":1430331327000},"page":"39-61","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Packing anchored rectangles"],"prefix":"10.1007","volume":"35","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"key":"3006_CR1","unstructured":"Ponder this challenge: puzzle for June 2004; http:\/\/domino.research.ibm.com\/comm\/wwwr_ponder.nsf\/Challenges\/June2004.html."},{"key":"3006_CR2","volume-title":"Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables","author":"M. Abramovitz","year":"1964","unstructured":"M. Abramovitz and I. Stegun: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Dover, New York, 1964."},{"key":"3006_CR3","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1137\/080736831","volume":"39","author":"N. Bansal","year":"2009","unstructured":"N. Bansal, A. Caprara and M. Sviridenko: A new approximation method for set covering problems, with applications to multidimensional bin packing, SIAM J. Comput. 39 (2009), 1256\u20131278.","journal-title":"SIAM J. Comput."},{"key":"3006_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1287\/moor.1050.0168","volume":"31","author":"N. Bansal","year":"2006","unstructured":"N. Bansal, J. Correa, C. Kenyon and M. Sviridenko: Bin packing in multiple dimensions: inapproximability results and approximation schemes, Math. Operat. Research 31 (2006), 31\u201349.","journal-title":"Math. Operat. Research"},{"key":"3006_CR5","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1137\/070691607","volume":"42","author":"N. Bansal","year":"2013","unstructured":"N. Bansal, X. Han, K. Iwama, M. Sviridenko and G. Zhang: A harmonic algorithm for the 3D strip packing problem, SIAM J. Comput. 42 (2013), 579\u2013592.","journal-title":"SIAM J. Comput."},{"key":"3006_CR6","first-page":"490","volume-title":"Packing 2-dimensional bins in harmony, in: Proc. 43rd FOCS, IEEE","author":"A. Caprara","year":"2002","unstructured":"A. Caprara: Packing 2-dimensional bins in harmony, in: Proc. 43rd FOCS, IEEE, 2002, 490\u2013499."},{"key":"3006_CR7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1287\/moor.1070.0289","volume":"33","author":"A. Caprara","year":"2008","unstructured":"A. Caprara: Packing d-dimensional bins in d stages, Math. Oper. Res. 33 (2008), 203\u2013215.","journal-title":"Math. Oper. Res."},{"issue":"3","key":"3006_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.jda.2009.02.002","volume":"7","author":"M. Chleb\u013ak","year":"2009","unstructured":"M. Chleb\u013ak and J. Chleb\u013akov\u00e1: Hardness of approximation for orthogonal rectangle packing and covering problems, J. Discrete Alg. 7 (3) (2009), 291\u2013305.","journal-title":"J. Discrete Alg."},{"key":"3006_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.endm.2011.09.044","volume":"38","author":"T. Christ","year":"2011","unstructured":"T. Christ, A. Francke, H. Gebauer, J. Matousek and T. Uno: A doubly exponentially crumbled cake, Electronic Notes in Discrete Mathematics 38 (2011), 265\u2013271.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"3006_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0963-8","volume-title":"Unsolved Problems in Geometry, volume II of Unsolved Problems in Intuitive Mathematics","author":"H. T. Croft","year":"1991","unstructured":"H. T. Croft, K. J. Falconer and R. K. Guy: Unsolved Problems in Geometry, volume II of Unsolved Problems in Intuitive Mathematics, Springer, New York, 1991."},{"key":"3006_CR11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0097-3165(75)90099-0","volume":"19","author":"P. Erd\u0151s","year":"1975","unstructured":"P. Erd\u0151s and R. L. Graham: Note on packing squares with equal squares, J. Combin. Theory Ser. A 19 (1975), 119\u2013123.","journal-title":"J. Combin. Theory Ser."},{"key":"3006_CR12","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.comgeo.2013.08.008","volume":"47","author":"R. Harren","year":"2014","unstructured":"R. Harren, K. Jansen, L. Pr\u00e4del and R. van Stee: A (5=3+\u03b5)-approximation for strip packing, Comput. Geom. 47 (2014), 248\u2013267.","journal-title":"Comput. Geom."},{"key":"3006_CR13","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1142\/S0129054113500354","volume":"24","author":"R. Harren","year":"2013","unstructured":"R. Harren, K. Jansen, L. Pr\u00e4del, U. M. Schwarz and R. van Stee: Two for one: tight approximation of 2D bin packing, Int. J. Found. Comput. Sci. 24 (2013), 1299\u20131328.","journal-title":"Int. J. Found. Comput. Sci."},{"key":"3006_CR14","first-page":"184","volume-title":"Proc. 13th IPCO","author":"K. Jansen","year":"2008","unstructured":"K. Jansen and R. Solis-Oba: A polynomial time approximation scheme for the square packing problem, in: Proc. 13th IPCO, vol. 5035 of LNCS, Springer, 2008, 184\u2013198."},{"issue":"3","key":"3006_CR15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s00453-006-0194-5","volume":"47","author":"K. Jansen","year":"2007","unstructured":"K. Jansen and G. Zhang: Maximizing the total profit of rectangles packed into a rectangle, Algorithmica 47 (3) (2007), 323\u2013342.","journal-title":"Algorithmica"},{"key":"3006_CR16","volume-title":"Approximation algorithms for two-dimensional geometrical knapsack, Masters thesis, Department of Computer Science, University of Kiel","author":"L. Pr\u00e4del","year":"2008","unstructured":"L. Pr\u00e4del: Approximation algorithms for two-dimensional geometrical knapsack, Masters thesis, Department of Computer Science, University of Kiel, 2008."},{"key":"3006_CR17","first-page":"290","volume-title":"Reverse-fit: a 2-optimal algorithm for packing rectangles, in","author":"I. Schiermeyer","year":"1994","unstructured":"I. Schiermeyer: Reverse-fit: a 2-optimal algorithm for packing rectangles, in: Proc. 2nd ESA, vol. 855 of LNCS, Springer, 1994, 290\u2013299."},{"issue":"2","key":"3006_CR18","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A. Steinberg","year":"1997","unstructured":"A. Steinberg: A strip-packing algorithm with absolute performance bound 2, SIAM J. Comput. 26 (2) (1997), 401\u2013409.","journal-title":"SIAM J. Comput."},{"key":"3006_CR19","unstructured":"W. Tutte: Recent Progress in Combinatorics: Proceedings of the 3rd Waterloo Conference on Combinatorics, May 1968, Academic Press, New York, 1969."},{"key":"3006_CR20","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1201\/b10592","volume-title":"Mathematical Mind-Benders","author":"P. Winkler","year":"2007","unstructured":"P. Winkler: Packing rectangles, in: Mathematical Mind-Benders, A. K. Peters Ltd., Wellesley, MA, 2007, 133\u2013134."},{"issue":"11","key":"3006_CR21","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/1839676.1839700","volume":"53","author":"P. Winkler","year":"2010","unstructured":"P. Winkler: Puzzled: rectangles galore, Communications of the ACM 53 (11) (2010), 112.","journal-title":"Communications of the ACM"},{"issue":"12","key":"3006_CR22","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/1787234.1787260","volume":"53","author":"P. Winkler","year":"2010","unstructured":"P. Winkler: Puzzled: solutions and sources, Communications of the ACM 53 (12) (2010), 128.","journal-title":"Communications of the ACM"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3006-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-3006-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3006-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:51Z","timestamp":1559093571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-3006-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["3006"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-3006-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2]]}}}