Abstract
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. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Sgall, J. (2012). A new analysis of best fit bin packing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7288 LNCS, pp. 315–321). https://doi.org/10.1007/978-3-642-30347-0_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
