Approximation Algorithms for 3D Orthogonal Knapsack

We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted, and we wish to maximize the total profit. Since this optimization problem is NP-hard, we focus on approximation algorithms. We obtain fast and simple...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer science and technology Vol. 23; no. 5; pp. 749 - 762
Main Authors:	Diedrich, Florian, Harren, Rolf, Jansen, Klaus, Thöle, Ralf, Thomas, Henning
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.09.2008 Springer Nature B.V Institute of Computer Science, University of Kiel, 24098 Kiel, Germany%Max-Planck-Institut fur Informatik, Campus E1 4, 66123 Saarbrucken, Germany%Department of Computer Science, ETH Zurich, Zurich, Switzerland
Subjects:	Algorithms Approximation Artificial Intelligence Computer Science Criteria Data Structures and Information Theory Information Systems Applications (incl.Internet) Mathematical analysis Optimization Ratios Regular Paper Rotation Software Engineering Strip Studies Theory of Computation Three dimensional approximation algorithm geometric configurations computational and structural complexity
ISSN:	1000-9000, 1860-4749
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!