The average-case analysis of some on-line algorithms for bin packing
- 1 June 1986
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 6 (2), 179-200
- https://doi.org/10.1007/bf02579171
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On optimal matchingsCombinatorica, 1984
- Some unexpected expected behavior results for bin packingPublished by Association for Computing Machinery (ACM) ,1984
- Approximation Algorithms for Bin-Packing — An Updated SurveyPublished by Springer Nature ,1984
- Empirical and Poisson processes on classes of sets or functions too large for central limit theoremsProbability Theory and Related Fields, 1982
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981
- A bin packing algorithm with complexity O(n log n) and performance 1 in the stochastic limitLecture Notes in Computer Science, 1981
- Probabilistic analysis for simple one-and two-dimensional bin packing algorithmsInformation Processing Letters, 1980
- A lower bound for on-line bin packingInformation Processing Letters, 1980
- A stochastic model of bin-packingInformation and Control, 1980
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974