Colorful bin packing

G. Dósa, Leah Epstein

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

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 si ∈ [0,1] and a color c i ∈ C, where 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 - si. This problem generalizes standard online bin packing and online black and white bin packing (where |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 |C| ≥ 3, while it is known that such an algorithm exists for |C| = 2. We show that natural generalizations of classic algorithms for bin packing fail to work for the case |C| ≥ 3, and moreover, algorithms that perform well for black and white bin packing do not perform well either, already for the case |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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages170-181
Number of pages12
Volume8503 LNCS
ISBN (Print)9783319084039
DOIs
Publication statusPublished - 2014
Event14th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2014 - Copenhagen, Denmark
Duration: Jul 2 2014Jul 4 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8503 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other14th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2014
CountryDenmark
CityCopenhagen
Period7/2/147/4/14

Fingerprint

Bin Packing
Bins
Competitive Ratio
Color
Online Algorithms
Exceed
Valid
Lower bound

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Dósa, G., & Epstein, L. (2014). Colorful bin packing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8503 LNCS, pp. 170-181). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8503 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-08404-6_15

Colorful bin packing. / Dósa, G.; Epstein, Leah.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8503 LNCS Springer Verlag, 2014. p. 170-181 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8503 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dósa, G & Epstein, L 2014, Colorful bin packing. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 8503 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8503 LNCS, Springer Verlag, pp. 170-181, 14th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2014, Copenhagen, Denmark, 7/2/14. https://doi.org/10.1007/978-3-319-08404-6_15
Dósa G, Epstein L. Colorful bin packing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8503 LNCS. Springer Verlag. 2014. p. 170-181. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-08404-6_15
Dósa, G. ; Epstein, Leah. / Colorful bin packing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8503 LNCS Springer Verlag, 2014. pp. 170-181 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{33d4915fffbd475c88071825bf721aa1,
title = "Colorful bin packing",
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 si ∈ [0,1] and a color c i ∈ C, where 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 - si. This problem generalizes standard online bin packing and online black and white bin packing (where |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 |C| ≥ 3, while it is known that such an algorithm exists for |C| = 2. We show that natural generalizations of classic algorithms for bin packing fail to work for the case |C| ≥ 3, and moreover, algorithms that perform well for black and white bin packing do not perform well either, already for the case |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.",
author = "G. D{\'o}sa and Leah Epstein",
year = "2014",
doi = "10.1007/978-3-319-08404-6_15",
language = "English",
isbn = "9783319084039",
volume = "8503 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "170--181",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Colorful bin packing

AU - Dósa, G.

AU - Epstein, Leah

PY - 2014

Y1 - 2014

N2 - 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 si ∈ [0,1] and a color c i ∈ C, where 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 - si. This problem generalizes standard online bin packing and online black and white bin packing (where |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 |C| ≥ 3, while it is known that such an algorithm exists for |C| = 2. We show that natural generalizations of classic algorithms for bin packing fail to work for the case |C| ≥ 3, and moreover, algorithms that perform well for black and white bin packing do not perform well either, already for the case |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.

AB - 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 si ∈ [0,1] and a color c i ∈ C, where 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 - si. This problem generalizes standard online bin packing and online black and white bin packing (where |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 |C| ≥ 3, while it is known that such an algorithm exists for |C| = 2. We show that natural generalizations of classic algorithms for bin packing fail to work for the case |C| ≥ 3, and moreover, algorithms that perform well for black and white bin packing do not perform well either, already for the case |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.

UR - http://www.scopus.com/inward/record.url?scp=84904180295&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904180295&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-08404-6_15

DO - 10.1007/978-3-319-08404-6_15

M3 - Conference contribution

AN - SCOPUS:84904180295

SN - 9783319084039

VL - 8503 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 170

EP - 181

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -