{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:25:15Z","timestamp":1761323115026},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0020-0190(96)00112-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"229-232","source":"Crossref","is-referenced-by-count":15,"title":["A fundamental restriction on fully dynamic maintenance of bin packing"],"prefix":"10.1016","volume":"59","author":[{"given":"Zoran","family":"Ivkovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Errol L.","family":"Lloyd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00112-3_BIB1","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0890-5401(89)90003-5","article-title":"Parallel approximation algorithms for bin packing","volume":"82","author":"Anderson","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(96)00112-3_BIB2","article-title":"A lower bound for on-line one-dimensional bin packing algorithms","author":"Brown","year":"1979"},{"key":"10.1016\/0020-0190(96)00112-3_BIB3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0212014","article-title":"Dynamic bin packing","volume":"12","author":"Coffman","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00112-3_BIB4","series-title":"Algorithm Design for Computer System Design","first-page":"49","article-title":"Approximation algorithms for bin packing: An updated survey","author":"Coffman","year":"1984"},{"key":"10.1016\/0020-0190(96)00112-3_BIB5","series-title":"Introduction to Algorithms","author":"Corman","year":"1990"},{"issue":"4","key":"10.1016\/0020-0190(96)00112-3_BIB6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","article-title":"Bin packing can be solved within 1 + \u03b5 in linear time","volume":"1","author":"de la Vega","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(96)00112-3_BIB7","series-title":"Algorithms and Complexity, Proc. 1st Italian Conf.","first-page":"44","article-title":"New algorithms for on-line bin packing","author":"Gambosi","year":"1990"},{"key":"10.1016\/0020-0190(96)00112-3_BIB8","series-title":"Proc. 1st European Symp. on Algorithms","first-page":"224","article-title":"Fully dynamic algorithms for bin packing: Being (mostly) myopic helps","volume":"726","author":"Ivkovi\u0107","year":"1993"},{"key":"10.1016\/0020-0190(96)00112-3_BIB9","unstructured":"also: SIAM J. Comput., to appear."},{"key":"10.1016\/0020-0190(96)00112-3_BIB10","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0020-0190(80)90077-0","article-title":"A lower bound for on-line bin-packing","volume":"10","author":"Liang","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00112-3_BIB11","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","article-title":"A simple on-line bin-packing algorithm","volume":"3","author":"Lee","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(96)00112-3_BIB12","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0196-6774(89)90031-X","article-title":"On-line bin-packing in linear time","volume":"3","author":"Ramanan","year":"1989","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/0020-0190(96)00112-3_BIB13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322186.322187","article-title":"New algorithms for bin packing","volume":"27","author":"Yao","year":"1980","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001123?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001123?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T14:52:44Z","timestamp":1555944764000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0020019096001123"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00112-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}