Abstract
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is forbidden; we wish to maximize the total profit. Since this optimization problem is NP-hard, we focus on approximation algorithms. We obtain fast and simple algorithms 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. Topics: Algorithms, computational and structural complexity. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Diedrich, F., Harren, R., Jansen, K., Thöle, R., & Thomas, H. (2007). Approximation algorithms for 3D orthogonal knapsack. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4484 LNCS, pp. 34–45). Springer Verlag. https://doi.org/10.1007/978-3-540-72504-6_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
