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 条
  • [1] Comments on the hierarchically structured bin packing problem
    Lambert, Thomas
    Marchal, Loris
    Ucar, Bora
    INFORMATION PROCESSING LETTERS, 2015, 115 (02) : 306 - 309
  • [2] Approximation algorithms for the integrated path and bin packing problem
    Li, Weidong
    Sun, Ruiqing
    RAIRO-OPERATIONS RESEARCH, 2025, 59 (01) : 325 - 333
  • [3] Approximation algorithms for the two-dimensional bin packing problem
    Lodi, A
    Martello, S
    Vigo, D
    FIRST INTERNATIONAL CONFERENCE ON OPERATIONS AND QUANTITATIVE MANAGEMENT, VOL 1 AND 2, 1997, : 177 - 184
  • [4] Approximation algorithms for extensible bin packing
    Coffman, EG
    Lueker, GS
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 586 - 588
  • [5] Approximation Algorithms for Extensible Bin Packing
    E. G. Coffman
    George S. Lueker
    Journal of Scheduling, 2006, 9 : 63 - 69
  • [6] Approximation algorithms for extensible bin packing
    Coffman, EG
    Lueker, GS
    JOURNAL OF SCHEDULING, 2006, 9 (01) : 63 - 69
  • [7] PARALLEL APPROXIMATION ALGORITHMS FOR BIN PACKING
    ANDERSON, RJ
    MAYR, EW
    WARMUTH, MK
    INFORMATION AND COMPUTATION, 1989, 82 (03) : 262 - 277
  • [8] Approximation algorithms for the oriented two-dimensional bin packing problem
    Lodi, A
    Martello, S
    Vigo, D
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) : 158 - 166
  • [9] Algorithms for the Bin Packing Problem with Conflicts
    Fernandes-Muritiba, Albert E.
    Iori, Manuel
    Malaguti, Enrico
    Toth, Paolo
    INFORMS JOURNAL ON COMPUTING, 2010, 22 (03) : 401 - 415
  • [10] Algorithms for the bin packing problem with scenarios
    Borges, Yulle G. F.
    de Lima, Vinicius L.
    Miyazawa, Flavio K.
    Pedrosa, Lehilton L. C.
    de Queiroz, Thiago A.
    Schouery, Rafael C. S.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 48 (04)
12345