Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/82146
Type: Artigo de periódico
Title: Multidimensional cube packing
Author: Kohayakawa, Y
Miyazawa, FK
Raghavan, P
Wakabayashi, Y
Abstract: We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, find a packing of L into the minimum number of bins. We present two approximation algorithms for d-CPP, for fixed d. The first algorithm has an asymptotic performance bound that can be made arbitrarily close to 2 - (1/2)(d). The second algorithm is an improvement of the first and has an asymptotic performance bound that can be made arbitrarily close to 2 - (2/3)(d). To our knowledge, these results improve the bounds known so far for d = 2 and d = 3, and are the first results with bounds that are not exponential in the dimension.
Subject: approximation algorithms
multidimensional bin packing
asymptotic performance
Country: EUA
Editor: Springer
Rights: fechado
Identifier DOI: 10.1007/s00453-004-1102-5
Date Issue: 2004
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000223641900003.pdf279.53 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.