PUMA
Istituto di Informatica e Telematica     
Codenotti B., De Marco G., Leoncini M., Montangero M. Approximation Algorithms for a Hierarchically Structured Bin Packing. In: INFORMATION PROCESSING LETTERS (00400J0), vol. 89(5) pp. 215 - 221. Elsevier B.V, 2004.
 
 
Abstract
(English)
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.
DOI: 10.1016/j.ipl.2003.12.001
Subject Algorithms
Approximation algorithms
Bin packing
NP-hardness
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional