Abstract
In early seventies it was shown that the asymptotic approximation ratio of BestFit bin packing is equal to 1.7. We prove that also the absolute approximation ratio for BestFit bin packing is exactly 1.7, improving the previous bound of 1.75. This means that if the optimum needs Opt bins, BestFit always uses at most ⌊1.7·OPT⌋ bins. Furthermore we show matching lower bounds for all values of Opt, i.e., we give instances on which BestFit uses exactly ⌊1.7·OPT⌋ bins. Thus we completely settle the worst-case complexity of BestFit bin packing after more than 40 years of its study. © 2014 Springer-Verlag.
Cite
CITATION STYLE
Dósa, G., & Sgall, J. (2014). Optimal 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. 8572 LNCS, pp. 429–441). Springer Verlag. https://doi.org/10.1007/978-3-662-43948-7_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
