{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T03:46:24Z","timestamp":1754019984847},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":8720,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1016\/0890-5401(89)90003-5","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"262-277","source":"Crossref","is-referenced-by-count":44,"title":["Parallel approximation algorithms for bin packing"],"prefix":"10.1016","volume":"82","author":[{"given":"Richard J.","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernst W.","family":"Mayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90003-5_bib1","series-title":"Advances in Computng Research; Parallel and Distrubuted Computing","first-page":"17","article-title":"Parallelism and greedy algorithms","author":"Anderson","year":"1987"},{"issue":"No. 1","key":"10.1016\/0890-5401(89)90003-5_bib2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0196-6774(85)90018-5","article-title":"A new proof for the first-fit decreasing bin-packing algorithm","volume":"6","author":"Baker","year":"1985","journal-title":"J. Algorithms"},{"issue":"No. 2","key":"10.1016\/0890-5401(89)90003-5_bib3","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/3318.3478","article-title":"Optimal parallel generation of a computation tree form","volume":"7","author":"Bar-On","year":"1985","journal-title":"ACM Trans. Programming Lang. Systems"},{"key":"10.1016\/0890-5401(89)90003-5_bib4","series-title":"Proceedings, AFIPS Spring Joint Comput. Conf.","first-page":"307","article-title":"Sorting networks and their applications","author":"Batcher","year":"1968"},{"issue":"No. 2","key":"10.1016\/0890-5401(89)90003-5_bib5","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0020-0190(79)90152-2","article-title":"Linear programming is log-space hard forP","volume":"8","author":"Dobkin","year":"1979","journal-title":"Inform. Process. Lett."},{"issue":"No. 4","key":"10.1016\/0890-5401(89)90003-5_bib6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","article-title":"Bin packing can be solved within 1 + \u025b in linear time","volume":"1","author":"Fernandez de la Vega","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0890-5401(89)90003-5_bib7","series-title":"Proceedings, 10th Ann. ACM Symposium on Theory of Computing","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978"},{"issue":"No. 21","key":"10.1016\/0890-5401(89)90003-5_bib8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90092-5","article-title":"The maximum flow problem is log space complete forP","volume":"21","author":"Goldschlager","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90003-5_bib9","series-title":"Advances in Computing Research; Parallel and Distributed Computing","first-page":"39","article-title":"Fast scheduling algorithms on parallel computers","author":"Helmhold","year":"1987"},{"key":"10.1016\/0890-5401(89)90003-5_bib10","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","article-title":"Worst-case performance bounds for simple one-dimensional packing algorithms","volume":"3","author":"Johnson","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(89)90003-5_bib11","series-title":"Proceedings, 23rd Ann. IEEE Symposium on Foundations of Computer Science","first-page":"312","article-title":"An efficient approximation scheme for the one-dimensional bin-packing problem","author":"Karmarkar","year":"1982"},{"key":"10.1016\/0890-5401(89)90003-5_bib12","series-title":"Proceedings, 17th Ann. ACM Symposium on Theory of Computing","first-page":"22","article-title":"Constructing a perfect matching is in randomNC","author":"Karp","year":"1985"},{"issue":"1","key":"10.1016\/0890-5401(89)90003-5_bib13","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is log-space complete forP","volume":"7","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"issue":"No. 4","key":"10.1016\/0890-5401(89)90003-5_bib14","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(89)90003-5_bib15","series-title":"Proceedings, 20th Ann. IEEE Symposium on Foundations of Computer Science","first-page":"307","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979"},{"issue":"No. 2","key":"10.1016\/0890-5401(89)90003-5_bib16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900035?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900035?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T13:26:47Z","timestamp":1549027607000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0890540189900035"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90003-5","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}