Multidimensional cube packing

DOI10.1007/s00453-004-1102-5zbMath1082.90098OpenAlexW2155905327WikidataQ57904526 ScholiaQ57904526MaRDI QIDQ1762987

Prabhakar Raghavan, Flávio K. Miyazawa, Yoshiharu Kohayakawa, Yoshiko Wakabayashi

Publication date: 11 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1102-5

zbMATH Keywords

Approximation algorithmsAsymptotic performanceMultidimensional bin packing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Approximation algorithms (68W25)

Related Items (10)

Polynomial-time approximation schemes for circle and other packing problems ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Packing Cubes into a Cube in (D>3)-Dimensions ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Dynamic multi-dimensional bin packing ⋮ Prices of Anarchy of Selfish 2D Bin Packing Games ⋮ Online removable square packing ⋮ Two-dimensional packing with conflicts ⋮ ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING ⋮ Packing cubes into a cube is NP-complete in the strong sense

Cites Work

• Unnamed Item
• An on-line algorithm for multidimensional bin packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Bin packing can be solved within 1+epsilon in linear time
• On Packing Two-Dimensional Bins
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
• On packing of squares and cubes

This page was built for publication: Multidimensional cube packing