On strip packing With rotations
From MaRDI portal
Publication:3581413
DOI10.1145/1060590.1060702zbMath1192.68908OpenAlexW2168190509MaRDI QIDQ3581413
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060702
Related Items
Rectangle packing with one-dimensional resource augmentation ⋮ Strip packing with precedence constraints and strip packing with release times ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ Packing Rectangles into 2OPT Bins Using Rotations ⋮ Bin packing with general cost structures ⋮ Absolute approximation ratios for packing rectangles into bins ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ Online square-into-square packing ⋮ Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing ⋮ The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio ⋮ Three-dimensional packings with rotations ⋮ Hardness of approximation for orthogonal rectangle packing and covering problems ⋮ A note on online strip packing ⋮ Approximation algorithms for orthogonal packing problems for hypercubes ⋮ New approximability results for two-dimensional bin packing
