{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:35:28Z","timestamp":1759667728659},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s00224-009-9226-2","type":"journal-article","created":{"date-parts":[[2009,7,31]],"date-time":"2009-07-31T14:55:38Z","timestamp":1249052138000},"page":"79-92","source":"Crossref","is-referenced-by-count":15,"title":["Improved Results for a Memory Allocation Problem"],"prefix":"10.1007","volume":"48","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,1]]},"reference":[{"issue":"1\u20133","key":"9226_CR1","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.dam.2003.05.006","volume":"143","author":"L. Babel","year":"2004","unstructured":"Babel,\u00a0L., Chen,\u00a0B., Kellerer,\u00a0H., Kotov,\u00a0V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Appl. Math. 143(1\u20133), 238\u2013251 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9226_CR2","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1002\/nav.10058","volume":"92","author":"A. Caprara","year":"2003","unstructured":"Caprara,\u00a0A., Kellerer,\u00a0H., Pferschy,\u00a0U.: Approximation schemes for ordered vector packing problems. Nav. Res. Logist. 92, 58\u201369 (2003)","journal-title":"Nav. Res. Logist."},{"issue":"6","key":"9226_CR3","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1007\/s00224-006-1249-3","volume":"39","author":"F. Chung","year":"2006","unstructured":"Chung,\u00a0F., Graham,\u00a0R., Mao,\u00a0J., Varghese,\u00a0G.: Parallelism versus memory allocation in pipelined router forwarding engines. Theory Comput. Syst. 39(6), 829\u2013849 (2006)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"9226_CR4","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1137\/050639065","volume":"20","author":"L. Epstein","year":"2006","unstructured":"Epstein,\u00a0L.: Online bin packing with cardinality constraints. SIAM J.\u00a0Discrete Math. 20(4), 1015\u20131030 (2006)","journal-title":"SIAM J.\u00a0Discrete Math."},{"key":"9226_CR5","unstructured":"Epstein,\u00a0L., Levin,\u00a0A.: AFPTAS results for common variants of bin packing: A\u00a0new method to handle the small items. Manuscript (2007)"},{"key":"9226_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-540-77918-6_19","volume-title":"Fifth Workshop on Approximation and Online Algorithms (WAOA 2007)","author":"L. Epstein","year":"2008","unstructured":"Epstein,\u00a0L., van\u00a0Stee,\u00a0R.: Approximation schemes for packing splittable items with cardinality constraints. In: Fifth Workshop on Approximation and Online Algorithms (WAOA 2007). Lecture Notes in Computer Science, vol.\u00a04927, pp. 232\u2013245. Springer, Berlin (2008)"},{"key":"9226_CR7","volume-title":"Computers and Intractability: A\u00a0Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A\u00a0Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"3","key":"9226_CR8","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Fast algorithms for bin packing. J.\u00a0Comput. Syst. Sci. 8(3), 272\u2013314 (1974)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9226_CR9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1018947117526","volume":"92","author":"H. Kellerer","year":"1999","unstructured":"Kellerer,\u00a0H., Pferschy,\u00a0U.: Cardinality constrained bin-packing problems. Ann. Oper. Res. 92, 335\u2013348 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9226_CR10","first-page":"522","volume":"22","author":"K.L. Krause","year":"1975","unstructured":"Krause, K.L., Shen, V.Y., Schwetman, H.D.: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. J.\u00a0ACM 22(4), 522\u2013550 (1975)","journal-title":"J.\u00a0ACM"},{"issue":"3","key":"9226_CR11","first-page":"527","volume":"24","author":"K.L. Krause","year":"1977","unstructured":"Krause, K.L., Shen, V.Y., Schwetman, H.D.: Errata: \u201cAnalysis of several task-scheduling algorithms for a model of multiprogramming computer systems\u201d. J.\u00a0ACM 24(3), 527 (1977)","journal-title":"J.\u00a0ACM"},{"key":"9226_CR12","unstructured":"Mao,\u00a0J., Graham, R.L.: Parallel resource allocation of splittable items with cardinality constraints. Manuscript"},{"key":"9226_CR13","doi-asserted-by":"crossref","unstructured":"Shachnai,\u00a0H., Yehezkely,\u00a0O.: Fast asymptotic FPTAS for packing fragmentable items with costs. In: Proc. of the 16th International Symposium on Fundamentals of Computation Theory (FCT2007), pp.\u00a0482\u2013493 (2007)","DOI":"10.1007\/978-3-540-74240-1_42"},{"issue":"1","key":"9226_CR14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s00224-007-9082-x","volume":"43","author":"H. Shachnai","year":"2008","unstructured":"Shachnai,\u00a0H., Tamir,\u00a0T., Yehezkely,\u00a0O.: Approximation schemes for packing with item fragmentation. Theory Comput. Syst. 43(1), 81\u201398 (2008)","journal-title":"Theory Comput. Syst."},{"issue":"5","key":"9226_CR15","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A. Vliet van","year":"1992","unstructured":"van\u00a0Vliet, A.: An improved lower bound for online bin packing algorithms. Inf. Process. Lett. 43(5), 277\u2013284 (1992)","journal-title":"Inf. Process. Lett."},{"key":"9226_CR16","first-page":"207","volume":"27","author":"A.C.C. Yao","year":"1980","unstructured":"Yao, A.C.C.: New algorithms for bin packing. J.\u00a0ACM 27, 207\u2013227 (1980)","journal-title":"J.\u00a0ACM"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-009-9226-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T12:19:44Z","timestamp":1550837984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-009-9226-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["9226"],"URL":"https:\/\/doi.org\/10.1007\/s00224-009-9226-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,1]]}}}