{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:53:25Z","timestamp":1649069605771},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5921,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0304-3975(96)00282-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"265-273","source":"Crossref","is-referenced-by-count":2,"title":["An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension"],"prefix":"10.1016","volume":"178","author":[{"given":"Y.","family":"Kopidakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Zissimopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00282-4_BIB1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(88)90209-8","article-title":"Preemptive scheduling of independent jobs on a hypercube","volume":"28","author":"Chen","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"9","key":"10.1016\/S0304-3975(96)00282-4_BIB2","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1109\/12.57056","article-title":"Subcube allocation and task migration in hypercube multiprocessors","volume":"39","author":"Chen","year":"1990","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S0304-3975(96)00282-4_BIB3","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","article-title":"Bin packing can be solved in 1 + \u03b5 in linear time","volume":"1","author":"de la Wega","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(96)00282-4_BIB4","doi-asserted-by":"crossref","DOI":"10.1016\/S0166-218X(97)00130-3","article-title":"An approximation scheme for strip-packing of rectangles with bounded dimensions","author":"de la Wega","year":"1996"},{"key":"10.1016\/S0304-3975(96)00282-4_BIB5","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(96)00282-4_BIB6","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","article-title":"Using dual approximation algorithms for scheduling problems: theoretical and practical results","volume":"34","author":"Hochbaum","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00282-4_BIB7","series-title":"FOCS","first-page":"312","article-title":"An efficient approximation scheme for the one-dimentional bin packing problem","author":"Karmarkar","year":"1982"},{"issue":"1","key":"10.1016\/S0304-3975(96)00282-4_BIB8","doi-asserted-by":"crossref","DOI":"10.1109\/71.80186","article-title":"A top-down processor allocation scheme for hypercube computers","volume":"2","author":"Kim","year":"1991","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"10.1016\/S0304-3975(96)00282-4_BIB9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0020-0190(89)90223-8","article-title":"Bin packing with restricted piece sizes","volume":"31","author":"Leung","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00282-4_BIB10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/71.205653","article-title":"On job scheduling on a hypercube","volume":"4","author":"Zhu","year":"1993","journal-title":"IEEE Trans. Parallel Distrib. Systems"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002824?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002824?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:56:51Z","timestamp":1555390611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0304397596002824"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00282-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}