Packing Cubes into a Cube in (D>3)-Dimensions

DOI10.1007/978-3-319-21398-9_21zbMath1465.90088OpenAlexW2287826708MaRDI QIDQ3196389

Yiping Lu, Danny Z. Chen, Jianzhong Cha

Publication date: 29 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_21

zbMATH Keywords

NP-completenesspacking problemscube packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for orthogonal packing problems for hypercubes
• Cube packing.
• Multidimensional cube packing
• Packing cubes into a cube is NP-complete in the strong sense
• Online square and cube packing
• On Packing Two-Dimensional Bins
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing

This page was built for publication: Packing Cubes into a Cube in (D>3)-Dimensions