{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:29Z","timestamp":1725664769784},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614227"},{"type":"electronic","value":"9783540685296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_142","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:37:08Z","timestamp":1330292228000},"page":"321-332","source":"Crossref","is-referenced-by-count":2,"title":["On two dimensional packing"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"B.S. Baker, E.G. Coffman, Jr, and R.L. Rivest. Orthogonal packings in two dimensions. In The SIAM Journal of Computing, pages 846\u2013855, 1980.","DOI":"10.1137\/0209064"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. New algorithms for an ancient scheduling problem. In Proc. 24th ACM Symp. on Theory of Computing, pages 51\u201358, 1992.","DOI":"10.1145\/129712.129718"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Y. Bartal, H. Karloff, Y. Rabani. A better lower bound for on-line scheduling. In Information Processing Letters 50 pages 113\u2013116, 1994.","DOI":"10.1016\/0020-0190(94)00026-3"},{"key":"28_CR4","volume-title":"Econometric Institute","author":"B. Chen","year":"1993","unstructured":"B. Chen, and A. van Vliet. On the on-line scheduling algorithm RLS Report 9325\/A, Econometric Institute, Erasmus University, Rotterdam. 1993."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"B. Chen, A. van Vliet, and G.J. Woeginger. New lower and upper bounds for on-line scheduling. In Operations Research Letters, pages 222\u2013230, 1994.","DOI":"10.1016\/0167-6377(94)90071-X"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"J. Csirik, J.B.G. Frenk, and M. Labbe. Two-dimensional rectangle packing: on-line methods and results. In Discrete applied Mathematics 45, pages 197\u2013204, 1993.","DOI":"10.1016\/0166-218X(93)90009-D"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"E.G. Coffman, Jr, M.R. Garey, D.S. Johnson, and R.E. Tarjan. Performance bounds for level oriented two-dimensional packing Algorithms. In The SIAM Journal of Computing, pages 808\u2013826, 1980.","DOI":"10.1137\/0209062"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, and P. Raghavan. Multidimensional on-line bin packing: algorithms and worst-case analysis. In Operation Research Letters, pages 17\u201320, 1989.","DOI":"10.1016\/0167-6377(89)90027-8"},{"key":"28_CR9","unstructured":"G. Galambos. A 1.6 lower bound for the two-dimensional on-line rectangle bin packing In Acta Cybernetica, pages 21\u201324, 1991."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"G. Galambos, A. van Vliet. Lower bounds for 1-,2-and 3-dimensional on-line bin packing algorithms. In Computing, pages 281\u2013297, 1994.","DOI":"10.1007\/BF02246509"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"G. Galambos, and G.J. Woeginger. An on-line scheduling heuristic with better worst case than Graham's list scheduling. In SIAM J. Comput. 22, pages 349\u2013355, 1993.","DOI":"10.1137\/0222026"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"R.L. Graham. Bounds for certain multiprocessing anomalies. In Bell System Tech J. 45, pages 1563\u20131581, 1966.","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. In The SIAM Journal of Computing, pages 299\u2013325, 1974.","DOI":"10.1137\/0203025"},{"key":"28_CR14","unstructured":"H. Karloff. Personal communication."},{"key":"28_CR15","unstructured":"D.R. Karger, S.J. Phillips, and E. Torng. A better algorithm for an ancient scheduling problem. In Proc. 5 Ann. ACM-SIAM symposium on Discrete Algorithms, pages 132\u2013140, 1994."},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"F. M. Liang. A lower bound for on-line bin packing. In Information Processing letters, pages 76\u201379, 1980.","DOI":"10.1016\/S0020-0190(80)90077-0"},{"key":"28_CR17","series-title":"Ph.D. thesis","volume-title":"Lower and upper bounds for on-line bin packing and scheduling heuristics","author":"A. Vliet van","year":"1995","unstructured":"A. van Vliet. Lower and upper bounds for on-line bin packing and scheduling heuristics. Ph.D. thesis. Thesis publishers, Amsterdam, 1995."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"A.C. Yao. New algorithms for bin packing. In Journal of the ACM, pages 207\u2013227, 1980.","DOI":"10.1145\/322186.322187"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_142.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:54Z","timestamp":1619573514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_142","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}