Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
P.W. Shor , Massachusetts Institute of Technology
In this paper we give tighter bounds than were previously known for the performance of the bin packing algorithms Bets Fit and First Fit when the inputs are uniformly distributed on [0,1]. We also give a general lower bound for the performance of any on-line bin packing algorithm. These results are proven by analyzing problems concerning matching random points in a unit square. We give a new lower bound for upward right matching and grid matching.
P.W. Shor, "The Average-Case Analysis of Some On-Line Algorithms for Bin Packing", FOCS, 1984, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1984, pp. 193-200, doi:10.1109/SFCS.1984.715915