A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
On-line bin packing in linear time
Journal of Algorithms
An on-line algorithm for variable-sized bin packing
Acta Informatica
Improved bounds for harmonic-based bin packing algorithms
Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
An improved lower bound for on-line bin packing algorithms
Information Processing Letters
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
New Algorithms for Bin Packing
Journal of the ACM (JACM)
Resource Augmentation for Online Bounded Space Bin Packing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Fast algorithms for bin packing
Journal of Computer and System Sciences
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Removable Online Knapsack Problems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
| Hi-index | 0.00 |
A new framework for analyzing online bin packing algorithms is presented. This framework presents a unified way of explaining the performance of algorithms based on the Harmonic approach [3, 5, 8, 10, 11, 12]. Within this framework, it is shown that a new algorithm, Harmonic++, has asymptotic performance ratio at most 1.58889. It is also shown that the analysis of Harmonic+1 presented in [11] is incorrect; this is a fundamental logical flaw, not an error in calculation or an omitted case. The asymptotic performance ratio of Harmonic+1 is at least 1.59217. Thus Harmonic++ provides the best upper bound for the online bin packing problem to date.