作者
Bruno Codenotti, Gianluca De Marco, Mauro Leoncini, Manuela Montangero, Massimo Santini
发表日期
2004/3/16
期刊
Information processing letters
卷号
89
期号
5
页码范围
215-221
出版商
Elsevier
简介
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.
引用总数
学术搜索中的文章
B Codenotti, G De Marco, M Leoncini, M Montangero… - Information processing letters, 2004