An approximation algorithm for square packing.

DOI10.1016/J.ORL.2004.02.003zbMath1078.68162OpenAlexW1983390896MaRDI QIDQ703277

Rob van Stee

Publication date: 11 January 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.02.003

zbMATH Keywords

Approximation algorithmBin packingAbsolute worst-case ratioSquare packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (4)

Dynamic multi-dimensional bin packing ⋮ Packing Rectangles into 2OPT Bins Using Rotations ⋮ Absolute approximation ratios for packing rectangles into bins ⋮ Two-dimensional packing with conflicts

Cites Work

• Online algorithms. The state of the art
• Bin packing can be solved within 1+epsilon in linear time
• New bounds for multidimensional packing
• On Packing Two-Dimensional Bins
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• On packing of squares and cubes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximation algorithm for square packing.