Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
From MaRDI portal
Publication:5387964
DOI10.1287/moor.1050.0168zbMath1278.90324OpenAlexW2067823599WikidataQ65553921 ScholiaQ65553921MaRDI QIDQ5387964
M. I. Sviridenko, Nikhil Bansal, José R. Correa, Claire M. Kenyon
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1050.0168
Related Items (44)
Packing anchored rectangles ⋮ Rectangle packing with one-dimensional resource augmentation ⋮ Approximating Smallest Containers for Packing Three-Dimensional Convex Objects ⋮ Polynomial-time approximation schemes for circle and other packing problems ⋮ An AFPTAS for variable sized bin packing with general activation costs ⋮ Models and algorithms for packing rectangles into the smallest square ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Packing Cubes into a Cube in (D>3)-Dimensions ⋮ Packing into the smallest square: worst-case analysis of lower bounds ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ A \((5/3+\varepsilon)\)-approximation for strip packing ⋮ Dynamic multi-dimensional bin packing ⋮ A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Online circle and sphere 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 quantization framework for smoothed analysis of Euclidean optimization problems ⋮ Packing Rectangles into 2OPT Bins Using Rotations ⋮ Bin packing with general cost structures ⋮ On packing squares into a rectangle ⋮ Absolute approximation ratios for packing rectangles into bins ⋮ On-line algorithms for 2-space bounded 2-dimensional bin packing ⋮ A family of heuristic-based inequalities for maximizing overall safety margins in aircraft parking stands arrangement problems ⋮ Two-dimensional packing with conflicts ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing ⋮ Online bin packing of squares and cubes ⋮ Two-dimensional bin packing with one-dimensional resource augmentation ⋮ On Guillotine Separability of Squares and Rectangles. ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ Online square-into-square packing ⋮ Online bin packing of squares and cubes ⋮ Complexity and inapproximability results for parallel task scheduling and strip packing ⋮ Lower bounds for several online variants of bin packing ⋮ ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING ⋮ 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 ⋮ Resource augmentation in two-dimensional packing with orthogonal rotations ⋮ On capacitated covering with unit balls ⋮ Packing cubes into a cube is NP-complete in the strong sense ⋮ New approximability results for two-dimensional bin packing
This page was built for publication: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
