Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

TAMC

2007

Springer

2007

Springer

We study non-overlapping axis-parallel packings of 3D boxes with proﬁts into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total proﬁt. Since this optimization problem is NP-hard, we focus on approximation algorithms. We obtain fast and simple algorithms for the non-rotational scenario with approximation ratios 9 + and 8 + as well as an algorithm with approximation ratio 7 + that uses more sophisticated techniques; these are the smallest approximation ratios known for this problem. Furthermore, we show how the used techniques can be adapted to the case where rotation by 90◦ either around the z-axis or around all axes is permitted, where we obtain algorithms with approximation ratios 6 + and 5 + , respectively. Finally our methods yield a 3D generalization of a packability criterion and a strip packing algorithm with absolute approximation ratio 29/4, improving the previously best known result of 45/4. ∗ Research supported in par...

Related Content

Added |
09 Jun 2010 |

Updated |
09 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
TAMC |

Authors |
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas |

Comments (0)