{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:25Z","timestamp":1792111465021,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":5,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_31","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:52Z","timestamp":1461269032000},"page":"123-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Schemes for Bin Packing"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"31_CR1486","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"EG Coffman","year":"1996","unstructured":"Coffman EG, Garey MR, Johnson DS (1996) Approximation algorithms for bin packing: a survey. In: Hochbaum D (ed) Approximation algorithms for NP-hard problems. PWS, Boston, pp\u00a046\u201393"},{"key":"31_CR1487","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online algorithms: the state of the art","author":"J Csirik","year":"1998","unstructured":"Csirik J, Woeginger G (1998) On-line packing and covering problems. In: Fiat A, Woeginger G (eds) Online algorithms: the state of the art. LNCS, vol\u00a01442. Springer, Berlin, pp\u00a0147\u2013177"},{"key":"31_CR1488","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W Fernandez de la Vega","year":"1981","unstructured":"Fernandez de la Vega W, Lueker G (1981) Bin packing can be solved within 1 +\u025b in linear time. Combinatorica 1:349\u2013355","journal-title":"Combinatorica"},{"key":"31_CR1489","doi-asserted-by":"crossref","unstructured":"Karmarkar N, Karp RM (1982) An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd IEEE symposium on foundations of computer science (FOCS), Chicago, pp\u00a0312\u2013320","DOI":"10.1109\/SFCS.1982.61"},{"key":"31_CR1490","doi-asserted-by":"crossref","unstructured":"Rothvoss T (2013) Approximating bin packing withing O(log OPT log log OPT) bins. In: Proceedings of the 54th IEEE symposium on foundations of computer science (FOCS), Berkeley, pp\u00a020\u201329","DOI":"10.1109\/FOCS.2013.11"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:51:02Z","timestamp":1792108262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_31","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}