Sciweavers

Share
4 search results - page 1 / 1
» Online Bin Packing with Cardinality Constraints
Sort
View
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
12 years 3 days ago
Online Bin Packing with Cardinality Constraints
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
Leah Epstein
MFCS
2005
Springer
12 years 2 days 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
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
12 years 21 days ago
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
Leah Epstein, Rob van Stee
TCS
2008
11 years 6 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...
books