Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
From MaRDI portal
Recommendations
- Approximation schemes for multidimensional packing
- New approximability and inapproximability results for 2-dimensional bin packing
- New approximability results for two-dimensional bin packing
- Two-dimensional bin packing with one-dimensional resource augmentation
- New approximability results for two-dimensional bin packing
Cited in
(66)- Bin packing with controllable item sizes
- Three-dimensional packings with rotations
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Approximation algorithms for orthogonal packing problems for hypercubes
- A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems
- Fast approximate PCPs for multidimensional bin-packing problems
- Lower bounds for three-dimensional multiple-bin-size bin packing problems
- Packing cubes into a cube is NP-complete in the strong sense
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Approximation and online algorithms for multidimensional bin packing: a survey
- Online circle and sphere packing
- Bin packing with general cost structures
- Absolute approximation ratios for packing rectangles into bins
- Two-dimensional bin packing with one-dimensional resource augmentation
- An asymptotically exact algorithm for the high-multiplicity bin packing problem
- Resource augmentation in two-dimensional packing with orthogonal rotations
- New approximability results for two-dimensional bin packing
- Polynomial-time approximation schemes for circle packing problems
- Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems
- Online algorithm for 1-space bounded multi-dimensional bin packing
- One-space bounded algorithms for two-dimensional bin packing
- Approximating Smallest Containers for Packing Three-Dimensional Convex Objects
- Two for One: Tight Approximation of 2D Bin Packing
- Packing cubes into a cube in \((D>3)\)-dimensions
- Polynomial-time approximation schemes for circle and other packing problems
- About the Structure of the Integer Cone and Its Application to Bin Packing
- An AFPTAS for variable sized bin packing with general activation costs
- Models and algorithms for packing rectangles into the smallest square
- Packing Rectangles into 2OPT Bins Using Rotations
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A structural lemma in 2-dimensional packing, and its implications on approximability
- Some inequalities for bin packing
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- A (5/3+)-approximation for strip packing
- On-line algorithms for 2-space bounded 2-dimensional bin packing
- Packing, covering and tiling in two-dimensional spaces
- scientific article; zbMATH DE number 2086931 (Why is no real title available?)
- On capacitated covering with unit balls
- Packing d-Dimensional Bins in d Stages
- Approximation schemes for multidimensional packing
- New approximability and inapproximability results for 2-dimensional bin packing
- New approximability results for two-dimensional bin packing
- Online bin packing of squares and cubes
- Chips on wafers (extended abstract)
- Online bin packing of squares and cubes
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- Tight approximation algorithms for geometric bin packing with skewed items
- Peak demand minimization via sliced strip packing
- There is no APTAS for 2-dimensional vector bin packing: revisited
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- On Guillotine Separability of Squares and Rectangles.
- Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items
- Dynamic multi-dimensional bin packing
- On packing squares into a rectangle
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- Approximation schemes for geometric knapsack for packing spheres and fat objects
- Tight approximation algorithms for 2D guillotine strip packing
- Approximation algorithms for round-UFP and round-SAP
- Improved hardness of approximation for geometric bin packing
- On guillotine separable packings for the two-dimensional geometric knapsack problem
- Improved approximation algorithms for three-dimensional knapsack
- Improved approximation algorithms for three-dimensional bin packing
- Rectangle packing with one-dimensional resource augmentation
- Packing into the smallest square: worst-case analysis of lower bounds
- A quantization framework for smoothed analysis of Euclidean optimization problems
- Two-dimensional packing with conflicts
This page was built for publication: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387964)
