4 search results - page 1 / 1 » Improved Online Algorithms for 1-Space Bounded 2-Dimensional... |
ISAAC
2010
Springer
13 years 2 months ago
2010
Springer
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be p...
COCOON
2006
Springer
13 years 8 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
WAOA
2004
Springer
13 years 9 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
MFCS
2005
Springer
13 years 10 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...