An approximation scheme for strip packing of rectangles with bounded dimensions

被引：10
|
作者：
de la Vega, WF [1 ]
Zissimopoulos, V [1 ]
机构：
[1] Univ Paris 11, LRI, CNRS, URA 410, F-91405 Orsay, France
来源：
DISCRETE APPLIED MATHEMATICS | 1998年 / 82卷 / 1-3期
关键词：
strip packing; approximation algorithms;
D O I：
10.1016/S0166-218X(97)00130-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
It is shown that for any positive epsilon the strip-packing problem, i.e. the problem of packing a given list of rectangles into a strip of width 1 and minimum height, can be solved within 1 + epsilon times the optimal height, in linear time, if the heights and widths of these rectangles are all bounded below by an absolute constant delta > 0. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：93 / 101
页数：9
相关论文
共 50 条
  • [31] A Tight (3/2+ε)-Approximation for Skewed Strip Packing
    Galvez, Waldo
    Grandoni, Fabrizio
    Ameli, Afrouz Jabal
    Jansen, Klaus
    Khan, Arindam
    Rau, Malin
    ALGORITHMICA, 2023, 85 (10) : 3088 - 3109
  • [32] An Asymptotic Approximation Algorithm for 3D-Strip Packing
    Jansen, Klaus
    Solis-Oba, Roberto
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 143 - 152
  • [33] PARALLEL GENETIC PACKING OF RECTANGLES
    KROGER, B
    SCHWENDERLING, P
    VORNBERGER, O
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 496 : 160 - 164
  • [34] NUMBER OF RECTANGLES OF UNIT WIDTH SUFFICIENT FOR PACKING GIVEN RECTANGLES
    BAKENROT, VY
    MAKAREVICH, OB
    CHEFRANOV, AG
    CYBERNETICS, 1984, 20 (01): : 38 - 41
  • [35] A fast asymptotic approximation scheme for bin packing with rejection
    Bein, Wolfgang
    Correa, Jose R.
    Han, Xin
    COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES, 2007, 4614 : 209 - +
  • [36] A fast asymptotic approximation scheme for bin packing with rejection
    Bein, Wolfgang
    Correa, Jose R.
    Han, Xin
    THEORETICAL COMPUTER SCIENCE, 2008, 393 (1-3) : 14 - 22
  • [37] A polynomial time approximation scheme for the square packing problem
    Jansen, Klaus
    Solis-Oba, Roberto
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 2008, 5035 : 184 - +
  • [38] A sublinear-time approximation scheme for bin packing
    Batu, Tugkan
    Berenbrink, Petra
    Sohler, Christian
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5082 - 5092
  • [39] Bin packing in multiple dimensions: Inapproximability results and approximation schemes
    Bansal, N
    Correa, JR
    Kenyon, C
    Sviridenko, M
    MATHEMATICS OF OPERATIONS RESEARCH, 2006, 31 (01) : 31 - 49
  • [40] APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS
    Bougeret, Marin
    Dutot, Pierre-Francois
    Jansen, Klaus
    Robenek, Christina
    Trystram, Denis
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2011, 3 (04) : 553 - 586
12345