Abstract
The black and white bin packing problem is a variant of the classical bin packing problem, where in addition to a size, each item also has a color (black or white), and in each bin the colors of items must alternate. The problem has been studied extensively, but the best competitive online algorithm has competitiveness of 3. The competitiveness of 3 can be forced even when the sizes of items are ‘halved’, i.e. the sizes are restricted to be in (0, 1 / 2]. We give the first ‘better than 3’ competitive algorithm for the problem for the case that item sizes are in the range (0, 1 / 2]; our algorithm has competitiveness (Formula Presented.).
Cite
CITATION STYLE
Chen, J., Han, X., Bein, W., & Ting, H. F. (2015). Black and white bin packing revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9486, pp. 45–59). Springer Verlag. https://doi.org/10.1007/978-3-319-26626-8_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
