The Average-Case Analysis of Some On-Line Algorithms for Bin Packing

Authors:
P. W. Shor
Affiliations:
Massachusetts Institute of Technology
Venue:
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Year:
1984

Citing 0
Cited 4

Optimal Random Matchings on Trees and Applications

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Bin-packing with fragile objects and frequency allocation in cellular networks

Wireless Networks
A tight lower bound for optimal bin packing

Operations Research Letters
Optimal random matchings, tours, and spanning trees in hierarchically separated trees

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.