Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
SIAM Journal on Computing
The hardness of approximation: gap location
Computational Complexity
There is no asymptotic PTAS for two-dimensional vector packing
Information Processing Letters
On multi-dimensional packing problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
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
On rectangle packing: maximizing benefits
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On strip packing With rotations
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An asymptotic approximation algorithm for 3D-strip packing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Complexity of approximating bounded variants of optimization problems
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Bin packing with controllable item sizes
Information and Computation
Packing Rectangles into 2OPT Bins Using Rotations
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
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
Approximation algorithms for orthogonal packing problems for hypercubes
Theoretical Computer Science
Absolute approximation ratios for packing rectangles into bins
Journal of Scheduling
| Hi-index | 0.00 |
Recently Bansal and Sviridenko [4] proved that there is no asymptotic PTAS for 2-dimensional Orthogonal Rectangle Bin Packing without rotations allowed, unless $\text{\rm P}=\textrm{\rm NP}$. We show that similar approximation hardness results hold for several rectangle packing problems even if rotations by ninety degrees around the axes are allowed. Moreover, for some of these problems we provide explicit lower bounds on asymptotic approximation ratio of any polynomial time approximation algorithm.