New approximability and inapproximability results for 2-dimensional bin packing
From MaRDI portal
Publication:5501259
Recommendations
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- New approximability results for two-dimensional bin packing
- New approximability results for two-dimensional bin packing
- Two-dimensional bin packing with one-dimensional resource augmentation
- scientific article; zbMATH DE number 2086931
Cited in
(19)- New approximability results for two-dimensional bin packing
- Online removable square packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Resource augmentation in two-dimensional packing with orthogonal rotations
- Hardness of approximation for orthogonal rectangle packing and covering problems
- scientific article; zbMATH DE number 2230208 (Why is no real title available?)
- Three-dimensional packings with rotations
- scientific article; zbMATH DE number 2086931 (Why is no real title available?)
- Two-dimensional bin packing with one-dimensional resource augmentation
- A novel non-linear approach to minimal area rectangular packing
- Approximation schemes for multidimensional packing
- An approximation algorithm for square packing.
- Two-dimensional packing with conflicts
- A structural lemma in 2-dimensional packing, and its implications on approximability
- New approximability results for two-dimensional bin packing
- A 3-approximation algorithm for two-dimensional bin packing
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Two for One: Tight Approximation of 2D Bin Packing
- New Approximability Results for 2-Dimensional Packing Problems
This page was built for publication: New approximability and inapproximability results for 2-dimensional bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501259)
