Weitere Artikel dieser Ausgabe durch Wischen aufrufen
Y. Zhang’s research supported by NSFC (11171086) and Shenzhen Internet Industry Development Fund under grant No. JC201005270342A.
F.Y.L. Chin’s research supported by HK RGC grant HKU-7117/09E.
X. Han’s research supported by NSFC(11101065).
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), and the length of each side is no more than 1. These items must be packed without overlapping into d-dimensional hypercubes with unit length on each side. In d-dimensional space, any two dimensions i and j define a space P ij . When an item arrives, we must pack it into an active bin immediately without any knowledge of the future items, and 90∘-rotation on any plane P ij is allowed.
The objective is to minimize the total number of bins used for packing all these items in the sequence. In the 1-space bounded variant, there is only one active bin for packing the current item. If the active bin does not have enough space to pack the item, it must be closed and a new active bin is opened. For d-dimensional bin packing, an online algorithm with competitive ratio 4 d is given. Moreover, we consider d-dimensional hypercube packing, and give a 2 d+1-competitive algorithm. These two results are the first study on 1-space bounded multi dimensional bin packing and hypercube packing.
Bansal N, Caprara A, Sviridenko M (2006b) Improved approximation algorithm for multidimensional bin packing problems. In: FOCS 2006, pp 697–708
Blitz D, van Vliet A, Woeginger GJ (1996) Lower bounds on the asymptotic worst-case ratio of on-line bin packing algorithms. Unpublished manuscript
Caprara A (2002) Packing 2-dimensional bins in harmony. In FOCS 2002, pp 490–499
Chin FYL, Ting H-F, Zhang Y (2012) 1-space bounded algorithms for 2-dimensional bin packing. Int J Found Comput Sci (to appear)
Ferreira CE, Miyazawa EK, Wakabayashi Y (1999) Packing squares into squares. Pesqui Oper 19:223–237
Garey MR, Johnson DS (1979) Computers and intractability: a guide for the theory of NP-completeness. Freeman, San Francisco
Han X, Fujita S, Guo H (2001) A two-dimensional harmonic algorithm with performance ratio 2.7834. IPSJ SIG Not 93:43–50
Karmarkar N, Karp RM (1982) An efficient approximation scheme for the one-dimensional bin packing problem. In: Proc 23rd ann IEEE symp on foundations of comput sci. IEEE Computer Society, Los Alamitos, pp 312–320
Zhang Y, Chen J, Chin FYL, Han X, Ting H-F, Tsin YH (2010) Improved online algorithms for 1-space bounded 2-dimensional bin packing. In: Proc of the 21th annual international symposium on algorithms and computation (ISAAC 2010). LNCS, vol 6507. Springer, Berlin, pp 242–253
- Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
Francis Y. L. Chin
- Springer US
Neuer Inhalt/© ITandMEDIA