{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:26:11Z","timestamp":1774599971321,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s10951-006-5594-5","type":"journal-article","created":{"date-parts":[[2006,1,9]],"date-time":"2006-01-09T13:57:20Z","timestamp":1136815040000},"page":"63-69","source":"Crossref","is-referenced-by-count":18,"title":["Approximation Algorithms for Extensible Bin Packing"],"prefix":"10.1007","volume":"9","author":[{"suffix":"Jr.","given":"E. G.","family":"Coffman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George S.","family":"Lueker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5594_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Y. Azar, G. J. Woeginger, and T. Yadid, \u201cApproximation schemes for scheduling on parallel machines,\u201d Journal of Scheduling, 1, 55\u201366 (1998).","journal-title":"Journal of Scheduling"},{"key":"5594_CR2","unstructured":"Coffman, Jr., E. G. and G. S. Lueker, \u201cApproximation algorithms for extensible bin packing,\u201d in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 586\u2013588."},{"key":"5594_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(97)00216-0","volume":"65","author":"P. Dell'Olmo","year":"1998","unstructured":"Dell'Olmo, P., H. Kellerer, M. G. Speranza, and Z. Tuza, \u201cA 13\/12 approximation algorithm for bin packing with extendable bins,\u201d Information Processing Letters, 65, 229\u2013233 (1998).","journal-title":"Information Processing Letters"},{"key":"5594_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979."},{"issue":"2","key":"5594_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel M., L. Lov\u00e1sz, and A. Schrijver, \u201cThe ellipsoid method and its consequences in combinatorial optimization,\u201d Combinatorica, 1(2), 169\u2013197 (1981).","journal-title":"Combinatorica"},{"key":"5594_CR6","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., L. Lov\u00e1sz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics 2. Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"issue":"1","key":"5594_CR7","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D. S. Hochbaum","year":"1987","unstructured":"Hochbaum, D. S. and D. B. Shmoys, \u201cUsing dual approximation algorithms for scheduling problems: Theoretical and practical results,\u201d journal of the ACM, 34(1), 144\u2013162 (1987).","journal-title":"journal of the ACM"},{"key":"5594_CR8","doi-asserted-by":"crossref","unstructured":"Karmarkar, N. and R. M. Karp, \u201cAn efficient approximation scheme for the one-dimensional bin-packing problem,\u201d in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 312\u2013320.","DOI":"10.1109\/SFCS.1982.61"},{"issue":"1","key":"5594_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0216012","volume":"16","author":"F. D. Murgolo","year":"1987","unstructured":"Murgolo, F. D., \u201cAn efficient approximation scheme for variable-sized bin packing,\u201d SIAM Journal on Computing, 16(1),149\u2013161, (1987).","journal-title":"SIAM Journal on Computing"},{"key":"5594_CR10","unstructured":"Woeginger, G. J., \u201cWhen does a dynamic programming formulation guarantee the existence of an FPTAS,\u201d in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 820\u2013829."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-5594-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-006-5594-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-5594-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-5594-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T02:32:09Z","timestamp":1652495529000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-006-5594-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["5594"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-5594-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}