On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin   Packing
  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... 
Janos Csirik, David S. Johnson, and Claire Kenyon