Average-case analysis of the smart next fit algorithm

DOI10.1016/0020-0190(89)90077-XzbMATH Open0672.68018OpenAlexW1971235162MaRDI QIDQ1120280FDOQ1120280

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

Recommendations

• scientific article; zbMATH DE number 4773
• All-Around Near-Optimal Solutions for the Online Bin Packing Problem
• Average-case analysis of the modified harmonic algorithm
• Average case analysis of bounded space bin packing algorithms
• The average-case analysis of some on-line algorithms for bin packing

zbMATH Keywords

approximation algorithmsbin packingon-line algorithmsworst-case performanceaverage-case performance

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A simple on-line bin-packing algorithm
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Title not available (Why is that?)
• On-line bin packing in linear time
• Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• A stochastic model of bin-packing

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120280)