{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T01:00:12Z","timestamp":1778634012870,"version":"3.51.4"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031630200","type":"print"},{"value":"9783031630217","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_33","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"433-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Bottom-Left Algorithm for the Strip Packing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8656-3418","authenticated-orcid":false,"given":"Stefan","family":"Hougardy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Zondervan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"issue":"4","key":"33_CR1","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"BS Baker","year":"1980","unstructured":"Baker, B.S., Coffman, E.G., Jr., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM J. Comput. 9(4), 846\u2013855 (1980). https:\/\/doi.org\/10.1137\/0209064","journal-title":"SIAM J. Comput."},{"issue":"1","key":"33_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(80)90031-9","volume":"11","author":"DJ Brown","year":"1980","unstructured":"Brown, D.J.: An improved BL lower bound. Inf. Process. Lett. 11(1), 37\u201339 (1980). https:\/\/doi.org\/10.1016\/0020-0190(80)90031-9","journal-title":"Inf. Process. Lett."},{"key":"33_CR3","doi-asserted-by":"publisher","unstructured":"Chazelle, B.: The bottom-left bin-packing heuristic: an efficient implementation. IEEE Trans. Comput. C-32(8), 697\u2013707 (1983). https:\/\/doi.org\/10.1109\/TC.1983.1676307","DOI":"10.1109\/TC.1983.1676307"},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1007\/s00453-012-9713-8","volume":"68","author":"SP Fekete","year":"2014","unstructured":"Fekete, S.P., Kamphans, T., Schweer, N.: Online square packing with gravity. Algorithmica 68(4), 1019\u20131044 (2014). https:\/\/doi.org\/10.1007\/s00453-012-9713-8","journal-title":"Algorithmica"},{"issue":"10","key":"33_CR5","doi-asserted-by":"publisher","first-page":"3088","DOI":"10.1007\/s00453-023-01130-2","volume":"85","author":"W G\u00e1lvez","year":"2023","unstructured":"G\u00e1lvez, W., Grandoni, F., Jabal Ameli, A., Jansen, K., Khan, A., Rau, M.: A tight $$(3\/2+\\varepsilon )$$-approximation for skewed strip packing. Algorithmica 85(10), 3088\u20133109 (2023). https:\/\/doi.org\/10.1007\/s00453-023-01130-2","journal-title":"Algorithmica"},{"key":"33_CR6","doi-asserted-by":"publisher","unstructured":"Garey, M.R., Johnson, D.S.: \u201cStrong\u201d NP-completeness results: motivation, examples, and implications. J. Assoc. Comput. Mach. 25(3), 499\u2013508 (1978). https:\/\/doi.org\/10.1145\/322077.322090","DOI":"10.1145\/322077.322090"},{"issue":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.comgeo.2013.08.008","volume":"47","author":"R Harren","year":"2014","unstructured":"Harren, R., Jansen, K., Pr\u00e4del, L., van Stee, R.: A $$(5\/3+\\varepsilon )$$-approximation for strip packing. Comput. Geom. 47(2), 248\u2013267 (2014). https:\/\/doi.org\/10.1016\/j.comgeo.2013.08.008","journal-title":"Comput. Geom."},{"key":"33_CR8","doi-asserted-by":"publisher","unstructured":"Hougardy, S., Zondervan, B.: The bottom-left algorithm for the strip packing problem (2024). https:\/\/doi.org\/10.48550\/arXiv.2402.16572","DOI":"10.48550\/arXiv.2402.16572"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), pp. 85\u2013103. Plenum Press, New York, London (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:17:47Z","timestamp":1718975867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}