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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of computer science and technology Ročník 23; číslo 5; s. 749 - 762
Hlavní autoři:	Diedrich, Florian, Harren, Rolf, Jansen, Klaus, Thöle, Ralf, Thomas, Henning
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	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
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!