二项装箱算法最坏情况性能分析
数据结构与算法
2007-05-23 v1
摘要
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...
引用
@article{arxiv.cs/0509031,
title = {On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing},
author = {Janos Csirik and David S. Johnson and Claire Kenyon},
journal= {arXiv preprint arXiv:cs/0509031},
year = {2007}
}