Approximation algorithms for a hierarchically structured bin packing problem

被引：11
|
作者：
Codenotti, B
De Marco, G
Leoncini, M
Montangero, M [1 ]
Santini, M
机构：
[1] CNR, Ist Informat & Telemat, I-56100 Pisa, Italy
[2] Univ Modena, Dipartimento Sci Sociali Cognit & Quantitat, I-41100 Modena, Italy
[3] Univ Iowa, Dept Comp Sci, Iowa City, IA 52242 USA
来源：
INFORMATION PROCESSING LETTERS | 2004年 / 89卷 / 05期
关键词：
algorithms; approximation algorithms; bin packing; NP-hardness;
D O I：
10.1016/j.ipl.2003.12.001
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码：215 / 221
页数：7
相关论文
共 50 条
12345