Static job scheduling in partitionable mesh connected systems
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
SIAM Journal on Computing
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
Packing 2-Dimensional Bins in Harmony
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
VLSI module placement based on rectangle-packing by the sequence-pair
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Packing into the smallest square: Worst-case analysis of lower bounds
Discrete Optimization
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90^@? rotations are allowed. Our main contribution is a polynomial-time algorithm for packing rectangles into at most OPT bins whose sides have length (1+@e), for any positive @e. Additionally, we show near-optimal packing results for a number of related packing problems.