Sciweavers

4 search results - page 1 / 1
» Online square and cube packing
Sort
View
ACTA
2005
110views more  ACTA 2005»
13 years 4 months ago
Online square and cube packing
In online square packing, squares of different sizes arrive online and need to be packed into unit squares which are called bins. The goal is to minimize the number of bins used. ...
Leah Epstein, Rob van Stee
ISAAC
2010
Springer
221views Algorithms» more  ISAAC 2010»
13 years 2 months ago
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
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...
Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin...
WADS
2009
Springer
245views Algorithms» more  WADS 2009»
13 years 11 months ago
Online Square Packing
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
Sándor P. Fekete, Tom Kamphans, Nils Schwee...
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
13 years 6 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...