On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing
classification
💻 cs.DS
keywords
algorithmcasepackingperformanceworstasymptoticbounddefined
read the original abstract
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...
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.