Black and White Bin Packing Revisited

被引：1
|
作者：
Chen, Jing [1 ]
Han, Xin [2 ]
Bein, Wolfgang [3 ]
Ting, Hing-Fung [4 ]
机构：
[1] Kyoto Univ, Grad Sch Informat, Kyoto, Japan
[2] Dalian Univ Technol, Software Sch, Dalian, Peoples R China
[3] Univ Nevada, Dept Comp Sci, Las Vegas, NV 89154 USA
[4] Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
来源：
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015) | 2015年 / 9486卷
关键词：
D O I：
10.1007/978-3-319-26626-8_4
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The black and white bin packing problem is a variant of the classical bin packing problem, where in addition to a size, each item also has a color (black or white), and in each bin the colors of items must alternate. The problem has been studied extensively, but the best competitive online algorithm has competitiveness of 3. The competitiveness of 3 can be forced even when the sizes of items are 'halved', i.e. the sizes are restricted to be in (0, 1/2]. We give the first 'better than 3' competitive algorithm for the problem for the case that item sizes are in the range (0, 1/2]; our algorithm has competitiveness 8 3
引用
收藏
页码：45 / 59
页数：15
相关论文
共 50 条
  • [1] Offline black and white bin packing
    Balogh, Janos
    Bekesi, Jozsef
    Dosa, Gyorgy
    Epstein, Leah
    Kellerer, Hans
    Levin, Asaf
    Tuza, Zsolt
    THEORETICAL COMPUTER SCIENCE, 2015, 596 : 92 - 101
  • [2] Online Results for Black and White Bin Packing
    János Balogh
    József Békési
    György Dósa
    Leah Epstein
    Hans Kellerer
    Zsolt Tuza
    Theory of Computing Systems, 2015, 56 : 137 - 155
  • [3] Online Results for Black and White Bin Packing
    Balogh, Janos
    Bekesi, Jozsef
    Dosa, Gyoergy
    Epstein, Leah
    Kellerer, Hans
    Tuza, Zsolt
    THEORY OF COMPUTING SYSTEMS, 2015, 56 (01) : 137 - 155
  • [4] Batched bin packing revisited
    Gyorgy Dosa
    Journal of Scheduling, 2017, 20 : 199 - 209
  • [5] Batched bin packing revisited
    Dosa, Gyorgy
    JOURNAL OF SCHEDULING, 2017, 20 (02) : 199 - 209
  • [6] Bin Packing with Rejection Revisited
    Epstein, Leah
    ALGORITHMICA, 2010, 56 (04) : 505 - 528
  • [7] Multidimensional Bin Packing Revisited
    Moffitt, Michael D.
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2013, 2013, 8124 : 513 - 528
  • [8] Bin Packing with Rejection Revisited
    Leah Epstein
    Algorithmica, 2010, 56 : 505 - 528
  • [9] Bin packing with rejection revisited
    Epstein, Leah
    APPROXIMATION AND ONLINE ALGORITHMS, 2006, 4368 : 146 - 159
  • [10] Fully dynamic bin packing revisited
    Berndt, Sebastian
    Jansen, Klaus
    Klein, Kim-Manuel
    MATHEMATICAL PROGRAMMING, 2020, 179 (1-2) : 109 - 155
12345