Sciweavers

3 search results - page 1 / 1
» Online Interval Coloring with Packing Constraints
Sort
View
MFCS
2005
Springer
13 years 9 months ago
Online Interval Coloring with Packing Constraints
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...
Leah Epstein, Meital Levy
SIAMJO
2008
175views more  SIAMJO 2008»
13 years 3 months ago
On Bin Packing with Conflicts
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 . . ....
Leah Epstein, Asaf Levin
TCS
2008
13 years 3 months ago
Bincoloring
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...