Average Case Analysis of Bounded Space Bin Packing Algorithms

Authors:
Nir Naaman;Raphael Rom
Affiliations:
Technion—Israel Institute of Technology, Department of Electrical Engineering, 32000, Haifa, Israel;Technion—Israel Institute of Technology, Department of Electrical Engineering, 32000, Haifa, Israel
Venue:
Algorithmica
Year:
2007

Citing 0
Cited 3

Average-Case Competitive Analyses for One-Way Trading

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Average-case competitive analyses for one-way trading

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the one-dimensional bin packing problem and analyze the average case performance of bounded space algorithms. The analysis covers a wide variety of bin packing algorithms including Next-K Fit, K-Bounded Best Fit and Harmonic algorithms, as well as of others. We assume discrete item sizes, an assumption which is true in most real-world applications of bin packing. We present a Markov chains method which is general enough to calculate results for any i.i.d. discrete item size distribution. The paper presents many results heretofore unknown or conjectured from simulation. Some of the results are surprising as they differ considerably from results for continuous distributions.