Average-case analysis of the smart next fit algorithm

DOI10.1016/0020-0190(89)90077-XzbMath0672.68018OpenAlexW1971235162MaRDI QIDQ1120280

Prakash V. Ramanan

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90077-x

zbMATH Keywords

worst-case performanceon-line algorithmsapproximation algorithmsbin packingaverage-case performance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Algorithms in computer science (68W99)

Related Items (4)

Best fit bin packing with random order revisited ⋮ Average case analysis of bounded space bin packing algorithms ⋮ Average-case performance analysis of a 2D strip packing algorithm -- NFDH ⋮ Best Fit Bin Packing with Random Order Revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
• A simple on-line bin-packing algorithm
• A stochastic model of bin-packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• On-line bin packing in linear time

This page was built for publication: Average-case analysis of the smart next fit algorithm