{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:18Z","timestamp":1725489798714},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73951-7_32","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T06:18:03Z","timestamp":1187590683000},"page":"362-373","source":"Crossref","is-referenced-by-count":5,"title":["Improved Results for a Memory Allocation Problem"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"32_CR1","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.dam.2003.05.006","volume":"143","author":"L. Babel","year":"2004","unstructured":"Babel, L., Chen, B., Kellerer, H., Kotov, V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Applied Mathematics\u00a0143(1-3), 238\u2013251 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1002\/nav.10058","volume":"92","author":"A. Caprara","year":"2003","unstructured":"Caprara, A., Kellerer, H., Pferschy, U.: Approximation schemes for ordered vector packing problems. Naval Research Logistics\u00a092, 58\u201369 (2003)","journal-title":"Naval Research Logistics"},{"issue":"6","key":"32_CR3","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s00224-006-1249-3","volume":"39","author":"F. Chung","year":"2006","unstructured":"Chung, F., Graham, R., Mao, J., Varghese, G.: Parallelism versus memory allocation in pipelined router forwarding engines. Theory of Computing Systems\u00a039(6), 829\u2013849 (2006)","journal-title":"Theory of Computing Systems"},{"issue":"4","key":"32_CR4","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1137\/050639065","volume":"20","author":"L. Epstein","year":"2006","unstructured":"Epstein, L.: Online bin packing with cardinality constraints. SIAM Journal on Discrete Mathematics\u00a020(4), 1015\u20131030 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"32_CR5","unstructured":"Epstein, L., van Stee, R.: Approximation schemes for packing splittable items with cardinality constraints. Manuscript"},{"key":"32_CR6","volume-title":"Computers and Intractability: A Guide to the theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"32_CR7","unstructured":"Graham, R.L., Mao, J.: Parallel resource allocation of splittable items with cardinality constraints. Manuscript"},{"issue":"3","key":"32_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. Journal of Computer and System Sciences\u00a08(3), 272\u2013314 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1018947117526","volume":"92","author":"H. Kellerer","year":"1999","unstructured":"Kellerer, H., Pferschy, U.: Cardinality constrained bin-packing problems. Annals of Operations Research\u00a092, 335\u2013348 (1999)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"32_CR10","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/321906.321917","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. Journal of the ACM\u00a022(4), 522\u2013550 (1975)","journal-title":"Journal of the ACM"},{"issue":"3","key":"32_CR11","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/322017.322032","volume":"24","author":"K.L. Krause","year":"1977","unstructured":"Krause, K.L., Shen, V.Y., Schwetman, H.D.: Errata: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. Journal of the ACM\u00a024(3), 527 (1977)","journal-title":"Journal of the ACM"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11671411_26","volume-title":"Approximation and Online Algorithms","author":"H. Shachnai","year":"2006","unstructured":"Shachnai, H., Tamir, T., Yehezkely, O.: Approximation schemes for packing with item fragmentation. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 334\u2013347. Springer, Heidelberg (2006)"},{"issue":"5","key":"32_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A. Vliet van","year":"1992","unstructured":"van Vliet, A.: An improved lower bound for online bin packing algorithms. Information Processing Letters\u00a043(5), 277\u2013284 (1992)","journal-title":"Information Processing Letters"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"A.C.C. Yao","year":"1980","unstructured":"Yao, A.C.C.: New algorithms for bin packing. Journal of the ACM\u00a027, 207\u2013227 (1980)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T07:20:32Z","timestamp":1550820032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540739487","9783540739517"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}