We give a first-fit type algorithm, with running timeO(n), for the classical one-dimensional bin-packing problem, and examine it from a probabilistic point of view. Our main result is that the expected waste for this ...
详细信息
We give a first-fit type algorithm, with running timeO(n), for the classical one-dimensional bin-packing problem, and examine it from a probabilistic point of view. Our main result is that the expected waste for this algorithm isO(n 2/3).
暂无评论