{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:48:17Z","timestamp":1770745697357,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424239","type":"print"},{"value":"9783540446347","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44634-6_29","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:20:48Z","timestamp":1186741248000},"page":"313-324","source":"Crossref","is-referenced-by-count":18,"title":["Bin Packing with Item Fragmentation"],"prefix":"10.1007","author":[{"given":"Nir","family":"Menakerman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael","family":"Rom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"29_CR1","first-page":"49","volume-title":"Algorithm Design for Computer System Design","author":"E. G. Coffman Jr.","year":"1984","unstructured":"E. G. Coffman Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin-packing: An updated survey. In G. Ausiello, M. Lucertini, and P. Serafini, editors, Algorithm Design for Computer System Design, pp. 49\u2013106. Springer-Verlag, Wien, 1984."},{"key":"29_CR2","first-page":"46","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"E. G. Coffman Jr.","year":"1996","unstructured":"E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: A survey. In D. Hochbaum (ed), PSW publishing, Boston. Approximation Algorithms for NP-Hard Problems, pp. 46\u201393. 1996."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/0217002","volume":"17","author":"D. K. Friesen","year":"1988","unstructured":"D. K. Friesen and F. S. Kuhl. Analysis of a hybrid algorithm for packing unequal bins. SIAM J. of Computing, vol. 17, pp. 23\u201340, 1988.","journal-title":"SIAM J. of Computing"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0404007","volume":"4","author":"D. K. Friesen","year":"1991","unstructured":"D. K. Friesen and M. A. Langston. Analysis of a compound bin packing algorithm. SIAM J. Disc. Math, vol. 4, pp. 61\u201379, 1991.","journal-title":"SIAM J. Disc. Math"},{"key":"29_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. H. Freeman and Co., San Francisco 1979."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D. S. Johnson","year":"1974","unstructured":"D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worstcase performance bounds for simple one-dimensional packing algorithms. SIAM J. of Computing, 3:299\u2013325, 1974.","journal-title":"SIAM J. of Computing"},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D.S. Johnson","year":"1974","unstructured":"D.S. Johnson. Fast algorithms for bin packing. Journal of computer and system Science, vol. 8, pp. 272\u2013314, 1974.","journal-title":"Journal of computer and system Science"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"N. Karmarkar and R. M. Karp. An efficient approximation scheme for the one-dimensional bin packing problem. In Proc. 23rd Ann. Symp. on Foundations of Computer Science, pp. 312\u2013320, 1982.","DOI":"10.1109\/SFCS.1982.61"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C. C. Lee","year":"1985","unstructured":"C. C. Lee and D. T. Lee. A simple on-line packing algorithm. J. ACM, vol. 32, pp. 562\u2013572, 1985.","journal-title":"J. ACM"},{"issue":"11","key":"29_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0898-1221(98)00087-X","volume":"35","author":"C.A. Mandal-","year":"1998","unstructured":"Mandal-CA, Chakrabarti-PP and Ghose-S. Complexity of fragmentable object bin packing and an application. Computers and Mathematics with Applications, vol. 35, no. 11, pp. 91\u20137, 1998.","journal-title":"Computers and Mathematics with Applications"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Nir Menakerman and Raphael Rom. Bin packing problems with item fragmentation. Technical report, EE publication CITT #342, April 2001.","DOI":"10.1007\/3-540-44634-6_29"},{"key":"29_CR12","unstructured":"Multimedia Cable Network System Ltd., \u201cData-Over-Cable Service Interface Specifications-Radio Frequency Interface Specification\u201d, July 2000."},{"key":"29_CR13","unstructured":"J. D. Ullman. Complexity of sequencing Problems. Computer and Job-Shop Scheduling Theory. Wiley and Sons. 1976."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44634-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:12:18Z","timestamp":1556748738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44634-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424239","9783540446347"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44634-6_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}