Abstract
We study a variant of online bin packing, called colorful bin packing. In this problem, items that are presented one by one are to be packed into bins of size 1. Each item i has a size s i ∈ [0,1] and a color \(c_i \in {\cal{C}}\), where \({\cal{C}}\) is a set of colors (that is not necessarily known in advance). The total size of items packed into a bin cannot exceed its size, thus an item i can always be packed into a new bin, but an item cannot be packed into a non-empty bin if the previous item packed into that bin has the same color, or if the occupied space in it is larger than 1 − s i . This problem generalizes standard online bin packing and online black and white bin packing (where \(|{\cal{C}}|=2\)). We prove that colorful bin packing is harder than black and white bin packing in the sense that an online algorithm for zero size items that packs the input into the smallest possible number of bins cannot exist for \(|{\cal{C}}|\geq 3\), while it is known that such an algorithm exists for \(|{\cal{C}}|=2\). We show that natural generalizations of classic algorithms for bin packing fail to work for the case \(|{\cal{C}}|\geq 3\), and moreover, algorithms that perform well for black and white bin packing do not perform well either, already for the case \(|{\cal{C}}|=3\). Our main results are a new algorithm for colorful bin packing that we design and analyze, whose absolute competitive ratio is 4, and a new lower bound of 2 on the asymptotic competitive ratio of any algorithm, that is valid even for black and white bin packing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balogh, J., Békési, J., Dósa, G., Epstein, L., Kellerer, H., Tuza, Z.: Online results for black and white bin packing. Theory of Computing Systems (to appear)
Balogh, J., Békési, J., Galambos, G.: New lower bounds for certain classes of bin packing algorithms. Theoretical Computer Science 440-441, 1–13 (2012)
Dósa, G., Sgall, J.: First fit bin packing: A tight analysis. In: Proc. of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), pp. 538–549 (2013)
Dósa, G., Tuza, Z., Ye, D.: Bin packing with “largest in bottom” constraint: tighter bounds and generalizations. Journal of Combinatorial Optimization 26(3), 416–436 (2013)
Epstein, L.: On online bin packing with LIB constraints. Naval Research Logistics 56(8), 780–786 (2009)
Finlay, L., Manyem, P.: Online LIB problems: Heuristics for bin covering and lower bounds for bin packing. RAIRO Operetions Research 39(3), 163–183 (2005)
Johnson, D.S.: Near-optimal bin packing algorithms. PhD thesis, MIT, Cambridge, MA (1973)
Johnson, D.S.: Fast algorithms for bin packing. Journal of Computer and System Sciences 8(3), 272–314 (1974)
Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3, 256–278 (1974)
Lee, C.C., Lee, D.T.: A simple online bin packing algorithm. Journal of the ACM 32(3), 562–572 (1985)
Manyem, P.: Bin packing and covering with longest items at the bottom: Online version. The ANZIAM Journal 43(E), E186–E232 (2002)
Manyem, P., Salt, R.L., Visser, M.S.: Approximation lower bounds in online LIB bin packing and covering. Journal of Automata, Languages and Combinatorics 8(4), 663–674 (2003)
Seiden, S.S.: On the online bin packing problem. Journal of the ACM 49(5), 640–671 (2002)
Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ (1971)
van Vliet, A.: An improved lower bound for on-line bin packing algorithms. Information Processing Letters 43(5), 277–284 (1992)
Veselý, P.: Competitiveness of fit algorithms for black and white packing. Manuscript. presented in MATCOS 2013 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Dósa, G., Epstein, L. (2014). Colorful Bin Packing. In: Ravi, R., Gørtz, I.L. (eds) Algorithm Theory – SWAT 2014. SWAT 2014. Lecture Notes in Computer Science, vol 8503. Springer, Cham. https://doi.org/10.1007/978-3-319-08404-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-08404-6_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08403-9
Online ISBN: 978-3-319-08404-6
eBook Packages: Computer ScienceComputer Science (R0)