Online colored bin packing

DOI10.1007/978-3-319-18263-6_4zbMATH Open1386.68228arXiv1404.5548OpenAlexW1781979225MaRDI QIDQ3453281FDOQ3453281

Authors: Martin Böhm, Jiří Sgall, Pavel Veselý 

Publication date: 20 November 2015

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Abstract: In the Colored Bin Packing problem a sequence of items of sizes up to $1$ arrives to be packed into bins of unit capacity. Each item has one of $cgeq2$ colors and an additional constraint is that we cannot pack two items of the same color next to each other in the same bin. The objective is to minimize the number of bins. In the important special case when all items have size zero, we characterize the optimal value to be equal to color discrepancy. As our main result, we give an (asymptotically) 1.5-competitive algorithm which is optimal. In fact, the algorithm always uses at most $lceil1.5cdotOPTceil$ bins and we show a matching lower bound of $lceil1.5cdotOPTceil$ for any value of $OPTgeq2$. In particular, the absolute ratio of our algorithm is $5/3$ and this is optimal. For items of unrestricted sizes we give an asymptotically $3.5$-competitive algorithm. When the items have sizes at most $1/d$ for a real $dgeq2$ the asymptotic competitive ratio is $1.5+d/(d-1)$. We also show that classical algorithms First Fit, Best Fit and Worst Fit are not constant competitive, which holds already for three colors and small items. In the case of two colors---the Black and White Bin Packing problem---we prove that all Any Fit algorithms have absolute competitive ratio $3$. When the items have sizes at most $1/d$ for a real $dgeq2$ we show that the Worst Fit algorithm is absolutely $(1+d/(d-1))$-competitive.

Full work available at URL: https://arxiv.org/abs/1404.5548

Recommendations

• Colored bin packing: online algorithms and lower bounds
• Colorful bin packing
• Black and White Bin Packing Revisited
• scientific article; zbMATH DE number 1875408
• Class constrained bin packing revisited

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Cites Work

• On the online bin packing problem
• A simple on-line bin-packing algorithm
• New lower bounds for certain classes of bin packing algorithms
• Title not available (Why is that?)
• Optimal analysis of best fit bin packing
• Bounded space on-line bin packing: Best is better than first
• Two-bounded-space bin packing revisited
• Black and white bin packing
• Online results for black and white bin packing
• Colorful bin packing

Cited In (20)

• Online Mixed Packing and Covering
• Colored bin packing: online algorithms and lower bounds
• Class constrained bin covering
• Online dominating set
• Black and White Bin Packing Revisited
• Bincoloring
• Title not available (Why is that?)
• Locality-preserving allocations problems and coloured bin packing
• Offline black and white bin packing
• Online packing of arbitrary sized items into designated and multipurpose bins
• On colorful bin packing games
• Selfish colorful bin packing games
• On bin packing with clustering and bin packing with delays
• VNS matheuristic for a bin packing problem with a color constraint
• Black and white bin packing
• Packing random items of three colors
• Class constrained bin packing revisited
• Bin packing with directed stackability conflicts
• Title not available (Why is that?)
• Colorful bin packing

This page was built for publication: Online colored bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453281)