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 条
  • [31] Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
    Lin, Mingen
    Yang, Yang
    Xu, Jinhui
    ALGORITHMICA, 2010, 57 (02) : 232 - 251
  • [32] Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
    Mingen Lin
    Yang Yang
    Jinhui Xu
    Algorithmica, 2010, 57 : 232 - 251
  • [33] Improved approximation algorithms for Maximum Resource Bin Packing and Lazy Bin Covering problems
    Lin, Mingen
    Yang, Yang
    Xu, Jinhui
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 567 - +
  • [34] An asymptotic approximation scheme for the concave cost bin packing problem
    Leung, Joseph Y. -T.
    Li, Chung-Lun
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 191 (02) : 581 - 585
  • [35] Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms
    Fujiwara, Hiroshi
    Wanikawa, Yuta
    Yamamoto, Hiroaki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2021, E104D (03) : 362 - 369
  • [36] Mathematical models and exact algorithms for the Colored Bin Packing Problem
    Borges, Yulle G. F.
    Schouery, Rafael C. S.
    Miyazawa, Flavio K.
    COMPUTERS & OPERATIONS RESEARCH, 2024, 164
  • [37] A NOTE ON DUAL APPROXIMATION ALGORITHMS FOR CLASS CONSTRAINED BIN PACKING PROBLEMS
    Xavier, Eduardo C.
    Miyazawa, Flavio Keidi
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, 43 (02): : 239 - 248
  • [38] Upper bounds and algorithms for the maximum cardinality bin packing problem
    Labbé, M
    Laporte, G
    Martello, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (03) : 490 - 498
  • [39] Heuristic algorithms for the three-dimensional bin packing problem
    Lodi, A
    Martello, S
    Vigo, D
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) : 410 - 420
  • [40] ALGORITHMS FOR THE TWO DIMENSIONAL BIN PACKING PROBLEM WITH PARTIAL CONFLICTS
    Hamdi-Dhaoui, Khaoula
    Labadie, Nacima
    Yalaoui, Alice
    RAIRO-OPERATIONS RESEARCH, 2012, 46 (01) : 41 - 62
12345