On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing
<|reference_start|>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...<|reference_end|>
@article{csirik2005on,
    title={On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin
  Packing},
    author={Janos Csirik, David S. Johnson, and Claire Kenyon},
    journal={arXiv preprint arXiv:cs/0509031},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0509031},
    primaryClass={cs.DS}
}