๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Average Case Analysis of Bounded Space Bin Packing Algorithms

โœ Scribed by Nir Naaman; Raphael Rom

Publisher
Springer
Year
2007
Tongue
English
Weight
501 KB
Volume
50
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Average-case analysis of the bin-packing
Average-case analysis of the bin-packing problem with general cost structures
โœ Julien Bramel; WanSoo T. Rhee; David Simchi-Levi ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 100 KB

We consider a version of the famous bin-packing problem where the cost of a bin is a concave function of the number of items in the bin. We analyze the problem from an average-case point of view and develop techniques to determine the asymptotic optimal solution value for a variety of functions. We

Average-case analyses of first fit and r
Average-case analyses of first fit and random fit bin packing
โœ Susanne Albers; Michael Mitzenmacher ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 202 KB

We prove that the First Fit bin packing algorithm is stable under the input distribution U k -2 k for all k โ‰ฅ 3, settling an open question from the recent survey by Coffman, Garey, and Johnson ["Approximation algorithms for bin backing: A survey," Approximation algorithms for NP-hard problems, D. Ho