{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:16:50Z","timestamp":1743131810977,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":4,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_31","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:51Z","timestamp":1214505471000},"page":"57-59","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Schemes for Bin Packing"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1_31","first-page":"46","volume-title":"Approximation Algorithms for NP-hard Problems","author":"E.G. Coffman","year":"1996","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a\u00a0survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard Problems, pp.\u00a046\u201393. PWS, Boston (1996)"},{"key":"31_CR2_31","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online Algorithms: The State of the Art. LNCS, vol. 1442","author":"J. Csirik","year":"1998","unstructured":"Csirik, J., Woeginger, G.: On-line packing and covering problems. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms: The State of the Art. LNCS, vol.\u00a01442, pp.\u00a0147\u2013177. Springer, Berlin (1998)"},{"key":"31_CR3_31","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. Fernandez de la Vega","year":"1981","unstructured":"Fernandez de\u00a0la Vega, W., Lueker, G.: Bin packing can be solved within $$ { 1 + \\varepsilon } $$ in linear time. Combinatorica 1, 349\u2013355 (1981)","journal-title":"Combinatorica"},{"key":"31_CR4_31","first-page":"312","volume-title":"Proc. of the 23rd Annual Symposium on Foundations of Computer Science","author":"N. Karmarkar","year":"1982","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (FOCS), 1982, pp.\u00a0312\u2013320"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T01:58:21Z","timestamp":1662170301000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_31"}},"subtitle":["1982; Karmarker, Karp"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_31","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}