Sciweavers

AOR
2006
99views more  AOR 2006»
13 years 4 months ago
On-line bin Packing with Two Item Sizes
The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We...
Gregory Gutin, Tommy R. Jensen, Anders Yeo