Approximation algorithms for 3D orthogonal Knapsack

Authors:
Florian Diedrich;Rolf Harren;Klaus Jansen;Ralf Thöle;Henning Thomas
Affiliations:
Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany;Fachbereich Informatik, Universität Dortmund, Dortmund, Germany;Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany;Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany;Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany
Venue:
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Year:
2007

Citing 13
Cited 1

Packing squares into a square

Journal of Parallel and Distributed Computing
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
On three-dimensional packing

SIAM Journal on Computing
Dynamic scheduling on parallel machines

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
A Strip-Packing Algorithm with Absolute Performance Bound 2

SIAM Journal on Computing
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

Mathematics of Operations Research
Approximation algorithms

Approximation algorithms
Packing 2-Dimensional Bins in Harmony

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
An asymptotic approximation algorithm for 3D-strip packing

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

Mathematics of Operations Research
Harmonic algorithm for 3-dimensional strip packing problem

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the orthogonal knapsack problem for hypercubes

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Approximation algorithms for orthogonal packing problems for hypercubes

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.