85 search results - page 6 / 17 » On the sum-of-squares algorithm for bin packing |
EOR
2007
15 years 6 months ago
2007
154
click to vote
WAOA
2004
Springer
15 years 11 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...
178
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...