| dc.creator | Kohayakawa, Y | |
| dc.creator | Miyazawa, FK | |
| dc.creator | Raghavan, P | |
| dc.creator | Wakabayashi, Y | |
| dc.date | 2004 | |
| dc.date | NOV | |
| dc.date | 2014-11-14T07:21:58Z | |
| dc.date | 2015-11-26T16:05:13Z | |
| dc.date | 2014-11-14T07:21:58Z | |
| dc.date | 2015-11-26T16:05:13Z | |
| dc.date.accessioned | 2018-03-28T22:54:12Z | |
| dc.date.available | 2018-03-28T22:54:12Z | |
| dc.identifier | Algorithmica. Springer, v. 40, n. 3, n. 173, n. 187, 2004. | |
| dc.identifier | 0178-4617 | |
| dc.identifier | WOS:000223641900003 | |
| dc.identifier | 10.1007/s00453-004-1102-5 | |
| dc.identifier | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/82146 | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/82146 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/82146 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1265649 | |
| dc.description | 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. | |
| dc.description | 40 | |
| dc.description | 3 | |
| dc.description | 173 | |
| dc.description | 187 | |
| dc.language | en | |
| dc.publisher | Springer | |
| dc.publisher | New York | |
| dc.publisher | EUA | |
| dc.relation | Algorithmica | |
| dc.relation | Algorithmica | |
| dc.rights | fechado | |
| dc.rights | http://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0 | |
| dc.source | Web of Science | |
| dc.subject | approximation algorithms | |
| dc.subject | multidimensional bin packing | |
| dc.subject | asymptotic performance | |
| dc.subject | Bin Packing | |
| dc.subject | Algorithms | |
| dc.title | Multidimensional cube packing | |
| dc.type | Artículos de revistas | |
