In this paper we study a variant of the bin packing problem in which the items to be packed are structured as the leaves of a tree. The problem is motivated by document organization and retrieval. We show that the problem is NP-hard and we give approximation algorithms for the general case and for the particular case in which all the items have the same size.
Titolo: | Approximation Algorithms for a Hierachically Structured Bin Packing Problem | |
Autori: | ||
Data di pubblicazione: | 2004 | |
Rivista: | ||
Abstract: | In this paper we study a variant of the bin packing problem in which the items to be packed are structured as the leaves of a tree. The problem is motivated by document organization and retrieval. We show that the problem is NP-hard and we give approximation algorithms for the general case and for the particular case in which all the items have the same size. | |
Handle: | http://hdl.handle.net/11386/1000495 | |
Appare nelle tipologie: | 1.1.2 Articolo su rivista con ISSN |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.