{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T03:47:53Z","timestamp":1754020073206},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540779179"},{"type":"electronic","value":"9783540779186"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-77918-6_19","type":"book-chapter","created":{"date-parts":[[2008,2,8]],"date-time":"2008-02-08T08:41:19Z","timestamp":1202460079000},"page":"232-245","source":"Crossref","is-referenced-by-count":9,"title":["Approximation Schemes for Packing Splittable Items with Cardinality Constraints"],"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":"19_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":"19_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":"19_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":"19_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W.F. Vega de la","year":"1981","unstructured":"de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1+epsilon in linear time. Combinatorica\u00a01(4), 349\u2013355 (1981)","journal-title":"Combinatorica"},{"issue":"4","key":"19_CR5","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":"19_CR6","doi-asserted-by":"crossref","unstructured":"Epstein, L., van Stee, R.: Improved results for a memory allocation problem. In: WADS 2007. Workshop on Algorithms and Data Structures, pp. 362\u2013373 (2007)","DOI":"10.1007\/978-3-540-73951-7_32"},{"key":"19_CR7","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":"19_CR8","unstructured":"Graham, R.L., Mao, J.: Parallel resource allocation of splittable items with cardinality constraints (manuscript)"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM\u00a034(1), 144\u2013162 (1987)","journal-title":"Journal of the ACM"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 312\u2013320 (1982)","DOI":"10.1109\/SFCS.1982.61"},{"key":"19_CR11","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":"19_CR12","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":"19_CR13","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\u2013527 (1977)","journal-title":"Journal of the ACM"},{"key":"19_CR14","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":"4","key":"19_CR15","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Research Logistics\u00a041(4), 579\u2013585 (1994)","journal-title":"Naval Research Logistics"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77918-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T04:35:10Z","timestamp":1551414910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77918-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540779179","9783540779186"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77918-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}