On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing

Simple item page
dc.creatorCsirik, Janos
dc.creatorJohnson, David S.
dc.creatorKenyon, Claire
dc.date2005-09-12
dc.date.accessioned2026-07-07T03:23:26Z
dc.date.available2026-07-07T03:23:26Z
dc.descriptionThe 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...
dc.identifierhttps://arxiv.org/abs/cs/0509031
dc.identifierhttp://arxiv.org/abs/cs/0509031
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32938
dc.subjectData Structures and Algorithms
dc.subjectF.2.2
dc.titleOn the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing
dc.typetext

Files

Collections

arXiv