Journal of Parallel and Distributed Computing
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
New bounds for multi-dimensional packing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Packing 2-Dimensional Bins in Harmony
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Recent advances on two-dimensional bin packing problems
Discrete Applied Mathematics
Approximation schemes for multidimensional packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
New approximability and inapproximability results for 2-dimensional Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On rectangle packing: maximizing benefits
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Linear time-approximation algorithms for bin packing
Operations Research Letters
Packing Rectangles into 2OPT Bins Using Rotations
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Two for One: Tight Approximation of 2D Bin Packing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Absolute approximation ratios for packing rectangles into bins
Journal of Scheduling
An efficient algorithm for solving the container loading problem
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |
In the classical two-dimensional bin packing problem one is asked to pack a set of rectangular items, without overlap and without any rotation, into the minimum number of identical square bins. We give an approximation algorithm with absolute worst-case ratio of 3.