Average-case analyses of first fit and random fit bin packing

DOI<240::AID-RSA2>3.0.CO;2-V 10.1002/(SICI)1098-2418(200005)16:3<240::AID-RSA2>3.0.CO;2-VzbMath0953.68146OpenAlexW2053134800MaRDI QIDQ4487093

Susanne Albers, Michael Mitzenmacher

Publication date: 21 June 2000

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(200005)16:3<240::aid-rsa2>3.0.co;2-v

zbMATH Keywords

First Fit bin packing algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (4)

On stable embeddability of partitions ⋮ Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison ⋮ Analysis of Stochastic Online Bin Packing Processes ⋮ An efficient parallel mixed method for flow simulations in heterogeneous geological media

Cites Work

• Unnamed Item
• The average-case analysis of some on-line algorithms for bin packing
• Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
• Fast algorithms for bin packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Markov chains, computer proofs, and average-case analysis of best fit bin packing

This page was built for publication: Average-case analyses of first fit and random fit bin packing