Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
From MaRDI portal
Recommendations
Cited in
(11)- scientific article; zbMATH DE number 19811 (Why is no real title available?)
- Approximation algorithms for orthogonal packing problems for hypercubes
- Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Bin packing with controllable item sizes
- Approximation and online algorithms for multidimensional bin packing: a survey
- Polynomial-time approximation schemes for circle and other packing problems
- A Constraint-Based Approach for the Two-Dimensional Rectangular Packing Problem with Orthogonal Orientations
- Absolute approximation ratios for packing rectangles into bins
- LATIN 2004: Theoretical Informatics
- Packing Rectangles into 2OPT Bins Using Rotations
This page was built for publication: Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434557)