Reproduce “On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Janos Csirik, David S. Johnson, Claire Kenyon
The Sum-of-Squares (SS) online bin-packing algorithm receives a stronger worst-case guarantee without changing its decisions. The authors prove that for every input list it uses fewer than (25/9) times total item size divided by bin capacity, plus 2 bins. This improves the prior upper bound of 3; it is not tight, with a cited lower bound of 2.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.