{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:28:11Z","timestamp":1648553291816},"reference-count":3,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1980,7,1]],"date-time":"1980-07-01T00:00:00Z","timestamp":331257600000},"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":12069,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1980,7]]},"DOI":"10.1016\/0166-218x(80)90006-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"159-161","source":"Crossref","is-referenced-by-count":2,"title":["\u201cA posteriori\u201d evaluation of bin packing approximation algorithms"],"prefix":"10.1016","volume":"2","author":[{"given":"A.","family":"Aiello","sequence":"first","affiliation":[]},{"given":"E.","family":"Burattini","sequence":"additional","affiliation":[]},{"given":"A.","family":"Massarotti","sequence":"additional","affiliation":[]},{"given":"F.","family":"Ventriglia","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(80)90006-2_BIB1","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. of 3rd Annual Symp. on the Theory of Computing"},{"key":"10.1016\/0166-218X(80)90006-2_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-2001-2_9","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(80)90006-2_BIB3","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","article-title":"Fast algorithms for bin packing","volume":"8","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X80900062?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X80900062?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:24:11Z","timestamp":1555136651000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X80900062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,7]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,7]]}},"alternative-id":["0166218X80900062"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(80)90006-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1980,7]]}}}