Analysis of a compound bin packing algorithm
SIAM Journal on Discrete Mathematics
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Dynamic programming revisited: improving knapsack algorithms
Computing - Special issue on combinatorial optimization
Linear time algorithms for knapsack problems with bounded weights
Journal of Algorithms
New heuristics for one-dimensional bin-packing
Computers and Operations Research
Bounds on multiprocessing anomalies and related packing algorithms
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Worst-case analysis of the subset sum algorithm for bin packing
Operations Research Letters
Parametric Packing of Selfish Items and the Subset Sum Algorithm
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Efficient algorithms for real-life instances of the variable size bin packing problem
Computers and Operations Research
| Hi-index | 0.89 |
We analyze the worst-case ratio of natural variations of the so-called subset sum heuristic for the bin packing problem, which proceeds by filling one bin at a time, each as much as possible. Namely, we consider the variation in which the largest remaining item is packed in the current bin, and then the remaining capacity is filled as much as possible, as well as the variation in which all items larger than half the capacity are first packed in separate bins, and then the remaining capacity is filled as much as possible. For both variants, we show a nontrivial upper bound of 13/9 on the worst-case ratio, also discussing lower bounds on this ratio.