215 search results - page 1 / 43 » Online Bin Coloring |
ESA
2001
Springer
15 years 5 months ago
2001
Springer
82
Voted
ESA
2008
Springer
15 years 2 months ago
2008
Springer
112
Voted
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...
127
Voted
TCS
2010
14 years 11 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
120
Voted
SIAMJO
2008
15 years 1 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....