暂无分享,去创建一个
The Sum of Squares algorithm for bin packing was defined in [2] and studied in great detail in [1], where it was proved that its worst case performance ratio is at most 3. In this note, we improve the asymptotic worst case bound to 2.7777...
[1] Claire Mathieu,et al. A Self Organizing Bin Packing Heuristic , 1999, ALENEX.
[2] Claire Mathieu,et al. On the Sum-of-Squares algorithm for bin packing , 2002, JACM.