"A new analysis of best fit bin packing" . . "Fun with Algorithms" . "P(IAA100190902)" . . "RIV/67985840:_____/12:00387099!RIV13-AV0-67985840" . . "A new analysis of best fit bin packing" . "1"^^ . "A new analysis of best fit bin packing"@en . . "Sgall, Ji\u0159\u00ED" . "120339" . "Heidelberg" . . . "A new analysis of best fit bin packing"@en . . "Venice" . . "7"^^ . . . . "problem complexity; approximation"@en . "Springer-Verlag" . "2012-06-04+02:00"^^ . "[38E963D72928]" . "RIV/67985840:_____/12:00387099" . . . "978-3-642-30346-3" . "10.1007/978-3-642-30347-0_31" . "We give a simple proof and a generalization of the classical result which says that the (asymptotic) approximation ratio of BestFit algorithm is 1.7. We generalize this result to a wide class of algorithms that are allowed to pack the incoming item to any bin with load larger than 1/2 (if it fits), instead to the most full bin, and at the same time this class includes the bounded-space variants of these algorithms." . . . . "1"^^ . "We give a simple proof and a generalization of the classical result which says that the (asymptotic) approximation ratio of BestFit algorithm is 1.7. We generalize this result to a wide class of algorithms that are allowed to pack the incoming item to any bin with load larger than 1/2 (if it fits), instead to the most full bin, and at the same time this class includes the bounded-space variants of these algorithms."@en .