Average-case analysis of the smart next fit algorithm
From MaRDI portal
(Redirected from Average-case analysis of the smart next fit algorithm)
Recommendations
Cites work
- A simple on-line bin-packing algorithm
- A stochastic model of bin-packing
- scientific article; zbMATH DE number 4014028 (Why is no real title available?)
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 4033058 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On-line bin packing in linear time
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(6)- Average-case performance analysis of a 2D strip packing algorithm -- NFDH
- Best fit bin packing with random order revisited
- Average case analysis of bounded space bin packing algorithms
- Best fit bin packing with random order revisited
- Near-optimal algorithms for stochastic online bin packing
- Fast algorithms for a large-scale file aggregation problem
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)