Packing Rectangles into 2OPT Bins Using Rotations

DOI10.1007/978-3-540-69903-3_28zbMath1155.68579OpenAlexW1507102160MaRDI QIDQ3512468

Rolf Harren, Rob van Stee

Publication date: 15 July 2008

Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_28

zbMATH Keywords

approximation algorithmbin packingrectangle packingabsolute worst-case ratio

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (4)

Two for One: Tight Approximation of 2D Bin Packing ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Prices of Anarchy of Selfish 2D Bin Packing Games ⋮ Number of bins and maximum lateness minimization in two-dimensional bin packing

Cites Work

• An approximation algorithm for square packing.
• Maximizing the total profit of rectangles packed into a rectangle
• A 3-approximation algorithm for two-dimensional bin packing
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
• New Approximability Results for 2-Dimensional Packing Problems
• On strip packing With rotations
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• On packing of squares and cubes
• Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing

This page was built for publication: Packing Rectangles into 2OPT Bins Using Rotations