Packing cubes into a cube in (D>3)-dimensions
From MaRDI portal
Publication:3196389
Recommendations
Cites work
- Approximation algorithms for orthogonal packing problems for hypercubes
- Approximation schemes for multidimensional packing
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Cube packing.
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Multidimensional cube packing
- On Packing Two-Dimensional Bins
- Online square and cube packing
- Packing cubes into a cube is NP-complete in the strong sense
Cited in
(13)- Packing different cuboids with rotations and spheres into a cuboid
- Packing cubes into a cube is NP-complete in the strong sense
- Packing copies of the n-cube into its third power
- A cube-packing problem
- Packing points into a unit cube in higher space
- A space-indexed formulation of packing boxes into a larger box
- scientific article; zbMATH DE number 1512676 (Why is no real title available?)
- scientific article; zbMATH DE number 7047830 (Why is no real title available?)
- Packing cubes into a cube is NP-hard in the strong sense
- scientific article; zbMATH DE number 6470126 (Why is no real title available?)
- Packing a trunk
- Cube packings, second moment and holes
- Packing \(1\times 2\times 4\) bricks in a cubical box
This page was built for publication: Packing cubes into a cube in \((D>3)\)-dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196389)