Approximation algorithms for 3D orthogonal knapsack

Journal of Computer Science and Technology

Volumn 23, Issue 5, 2008, Pages 749-762

  Diedrich, Florian ^a   Harren, Rolf ^b   Jansen, Klaus ^a   Thöle, Ralf ^a   Thomas, Henning ^c  

^a UNIVERSITY OF KIEL   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c ETH ZURICH   (Switzerland)

Author keywords

Approximation algorithm; Computational and structural complexity; Geometric configurations

Indexed keywords

APPROXIMATION RATIOS; COMPUTATIONAL AND STRUCTURAL COMPLEXITY; GEOMETRIC CONFIGURATIONS; NP-HARD; OPTIMIZATION PROBLEMS; SIMPLE ALGORITHMS; STRIP PACKINGS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; NUCLEAR PROPULSION; PACKING; POLYNOMIAL APPROXIMATION; ROTATION;

APPROXIMATION ALGORITHMS;

EID: 55549096377     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-008-9170-7     Document Type: Article

References (32)

1. Vazirani V V. Approximation Algorithms, Springer, 2001.
2. D D K Sleator 1980 A 2.5 times optimal algorithm for packing in two dimensions Information Processing Letters 10 1 37 40
3. B S Baker D J Brown H P Katseff 1981 A 5/4 algorithm for two-dimensional packing Journal of Algorithms 2 4 348 368
4. Schiermeyer I. Reverse-fit: A 2-optimal algorithm for packing rectangles. In Proc. ESA, Utrecht, The Netherlands, Lecture Notes in Computer Science 855, Jan van Leeuwen (ed.), Springer, 1994, pp.290-299.
5. A Steinberg 1997 A strip-packing algorithm with absolute performance bound 2 SIAM Journal of Computing 26 2 401 409
6. C Kenyon E Rémila 2000 A near-optimal solution to a two dimensional cutting stock problem Mathematics of Operations Research 25 4 645 656
7. Jansen K, R Solis-Oba R. New approximability results for 2-dimensional packing. Florian Diedrich et al.: Approximation of 3D Orthogonal Knapsack 29 problems. In Proc. MFCS 2007, Ceský Krumlov, Czech Republic, Ludek Kucera, Antonín Licera (eds)., Lecture Notes in Computer Science, 4708, Springer, 2007, pp.103-114.
8. F K Miyazawa Y Wakabayashi 1997 An algorithm for the three-dimensional packing problem with asymptotic performance analysis Algorithmica 18 1 122 144
9. Jansen K, Solis-Oba R. An asymptotic approximation algorithm for 3D-strip packing. In Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, Miami, Florida, USA, pp.143-152.
10. Bansal N, Han X, Iwama K, Sviridenko M, Zhang G. Harmonic algorithm for 3-dimensional strip packing problem. In Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, Louisiana, USA, 2007, pp.1197-1206.
11. K Li K H Cheng 1990 On three-dimensional packing SIAM Journal of Computing 19 5 847 867
12. K Li K H Cheng 1992 Heuristic algorithms for on-line packing in three dimensions Journal of Algorithms 13 4 589 605
13. W. Fernandez de la Vega G. Lueker 1981 Bin packing can be solved within 1+ε in linear time Combinatorica 1 4 349 355
14. R H Li M Y Yue 1997 The proof of FFD(L)≤(11/9)OPT(L)+(7/9) Chinese Science Bulletin 42 1262 1265
15. Dósa G. The tight bound of first fit decreasing bin-packing algorithm is FFD(I)≤11 9OPT(I)+6=9. In Proc. ESCAPE, Hangzhou, China, Bo Chen, Mike Paterson, Guochuan Zhang (eds.), Lecture Notes in Computer Science 4614, Springer, 2007, pp.1-11.
16. Caprara A. Packing two-dimensional bins in harmony. In Proc. 43rd Symposium on Foundations of Computer Science (FOCS), Pittsburgh, PA, USA, 2005, pp.490-499.
17. Bansal N, Caprara A, Sviridenko M. Improved approximation algorithms for multidimensional bin packing problems. In Proc. 47th Symposium on Foundations of Computer Science (FOCS), Berkeley, CA, USA, 2006, pp.697-708.
18. N Bansal J R Correa C Kenyon M Sviridenko 2006 Bin packing in multiple dimensions: Inapproximability results and approximation schemes Mathematics of Operations Research 31 1 31 49
19. Diedrich F. Approximative algorithmen für rucksackprobleme [Thesis]. Institut für Informatik und Praktische Mathematik der Christian-Albrechts- Universität zu Kiel, 2004.
20. K Jansen G Zhang 2007 Maximizing the total profit of rectangles packed into a rectangle Algorithmica 47 3 323 342
21. Kellerer K, Pferschy U, Pisinger D. Knapsack Problems, Springer, 2004.
22. Martello S, Toth P. Knapsack Problems: Algorithms and Computer Implementations. Wiley, 1990.
23. Rolf Harren. Approximating the orthogonal knapsack problem for hypercubes. In Proc. ICALP (1), Venice, Italy, Lecture Notes in Computer Science, 4051, Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener (eds.), 2006, pp.238-249.
24. Chlebík M, Chlebíková, J. Inapproximability results for or-thogonal rectangle packing problems with rotations. In Proc. 6th Conference on Algorithms and Complexity (CIAC), Rome, Italy, 2006, pp.199-210.
25. Ye D, Zhang G. Online scheduling of parallel jobs with dependencies on 2-dimensional meshes. In Proc. ISAAC, Kyoto, Japan, Lecture Notes in Computer Science 2906, Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono (eds.), Springer, 2003, pp.329-338.
26. A Feldmann J Sgall S H Teng 1994 Dynamic scheduling on parallel machines Theoretical Computer Science (Special Issue on Dynamic and On-Line Algorithms) 130 1 49 72
27. E Lawler 1979 Fast approximation algorithms for knapsack problems Mathematics of Operations Research 4 4 339 356
28. Ludwig W, Tiwari P. Scheduling malleable and nonmalleable parallel tasks. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (SODA), Arlington, Virginia, USA, 1994, pp.167-176.
29. L Epstein, R van Stee. This side up! In Proc. WAOA, Bergen, Norway, Lecture Notes in Computer Science 3351, Giuseppe Persiano, Roberto Solis-Ob, (eds.), Springer, 2004, pp.48-60.
30. L Epstein R van Stee 2006 This side up! ACM Transactions on Algorithms 2 2 228 243
31. F K Miyazawa Y Wakabayashi 1999 Approximation algorithms for the orthogonal z-oriented three-dimensional packing problem SIAM Journal of Computing 29 3 1008 1029
32. J Y T Leung T W Tam C S Wong G H Young F Y L Chin 1990 Packing squares into a square Journal of Parallel and Distributed Computing 10 3 271 275