Linear waste of best fit bin packing on skewed distributions

DOI10.1002/rsa.10037zbMath1017.68160OpenAlexW1983568249MaRDI QIDQ4537630

Claire M. Kenyon, Michael Mitzenmacher

Publication date: 1 July 2002

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10037

zbMATH Keywords

best fit

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (1)

Interior-Point-Based Online Stochastic Bin Packing

Cites Work

• 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
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing
• Markov chains, computer proofs, and average-case analysis of best fit bin packing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear waste of best fit bin packing on skewed distributions