85 search results - page 7 / 17 » On the sum-of-squares algorithm for bin packing |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
100
click to vote
RANDOM
1998
Springer
15 years 2 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
SWAT
2010
Springer
15 years 3 months ago
2010
Springer
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
TCS
2010
14 years 8 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...