{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:25:25Z","timestamp":1759667125520,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266251"},{"type":"electronic","value":"9783319266268"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_4","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T04:08:43Z","timestamp":1449634123000},"page":"45-59","source":"Crossref","is-referenced-by-count":2,"title":["Black and White Bin Packing Revisited"],"prefix":"10.1007","author":[{"given":"Jing","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Bein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00224-014-9538-8","volume":"56","author":"J B\u00e1logh","year":"2015","unstructured":"B\u00e1logh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Epstein, L., Kellerer, H., Tuza, Z.: Online results for black and white bin packing. Theory Comput. Syst. 56, 137\u2013155 (2015)","journal-title":"Theory Comput. Syst."},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-38016-7_12","volume-title":"Approximation and Online Algorithms","author":"J Balogh","year":"2013","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., Dosa, G., Kellerer, H., Tuza, Z.: Black and white bin packing. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 131\u2013144. Springer, Heidelberg (2013)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.04.017","volume":"440\u2013441","author":"J B\u00e1logh","year":"2012","unstructured":"B\u00e1logh, J., B\u00e9k\u00e9si, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. Theor. Comput. Sci. 440\u2013441, 1\u201313 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"13\u201314","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1914","DOI":"10.1016\/j.dam.2012.04.012","volume":"160","author":"J Boyar","year":"2012","unstructured":"Boyar, J., D\u00f3sa, G., Epstein, L.: On the absolute approximation ratio for First Fit and related Results. Discrete Appl. Math. 160(13\u201314), 1914\u20131923 (2012)","journal-title":"Discrete Appl. Math."},{"unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms. PWS Publishing Company (1997)","key":"4_CR5"},{"unstructured":"D\u00f3sa, G., Sgall, J.: First fit bin packing: a tight analysis. In: Proceedings of STACS 2013, LIPICS, vol. 20, pp. 538\u2013549 (2013)","key":"4_CR6"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-08404-6_15","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"G D\u00f3sa","year":"2014","unstructured":"D\u00f3sa, G., Epstein, L.: Colorful bin packing. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 170\u2013181. Springer, Heidelberg (2014)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-319-18263-6_4","volume-title":"Approximation and Online Algorithms","author":"M B\u00f6hm","year":"2015","unstructured":"B\u00f6hm, M., Sgall, J., Vesel\u00fd, P.: Online colored bin packing. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 35\u201346. Springer, Heidelberg (2015)"},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: \u201cStrong\u201d NP-completeness results: motivation, examples, and implications. J. ACM 25(3), 499\u2013508 (1978)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), pp. 312\u2013320 (1982)","key":"4_CR10","DOI":"10.1109\/SFCS.1982.61"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"CC Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin packing algorithm. J. ACM 32, 562\u2013572 (1985)","journal-title":"J. ACM"},{"issue":"5","key":"4_CR12","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S Seiden","year":"2002","unstructured":"Seiden, S.: On the online bin packing problem. J. ACM 49(5), 640\u2013671 (2002)","journal-title":"J. ACM"},{"unstructured":"Ullman, J.D.: The performance of a memory allocation algorithm. Technical report 100, Princeton University, Princeton 695 (1971)","key":"4_CR13"},{"unstructured":"Vesel\u00fd, P.: Competitiveness of fit algorithms for black and white bin packing. In: Middle-European Conference on Applied Theoretical Computer Science (2013)","key":"4_CR14"},{"issue":"15","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1016\/j.dam.2010.05.026","volume":"158","author":"BZ Xia","year":"2010","unstructured":"Xia, B.Z., Tan, Z.Y.: Tighter bound of the First Fit algorithm for the bin-packing problem. Discrete Appl. Math. 158(15), 1668\u20131675 (2010)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:16:00Z","timestamp":1559322960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}