A New Lower Bound for Classic Online Bin Packing

被引：5
|
作者：
Balogh, Janos [1 ]
Bekesi, Jozsef [2 ]
Dosa, Gyorgy [3 ]
Epstein, Leah [4 ]
Levin, Asaf [5 ]
机构：
[1] Univ Szeged, Inst Informat, Szeged, Hungary
[2] Univ Szeged, Gyula Juhasz Fac Educ, Dept Appl Informat, Szeged, Hungary
[3] Univ Pannonia, Dept Math, Veszprem, Hungary
[4] Univ Haifa, Dept Math, Haifa, Israel
[5] Technion, Fac Ind Engn & Management, Haifa, Israel
来源：
APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2019) | 2020年 / 11926卷
关键词：
ALGORITHMS;
D O I：
10.1007/978-3-030-39479-0_2
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packing to above 1.54278. We demonstrate for the first time the advantage of branching and the applicability of full adaptivity in the design of lower bounds for the classic online bin packing problem. We apply a new method for weight based analysis, which is usually applied only in proofs of upper bounds. The values of previous lower bounds were approximately 1.5401 and 1.5403.
引用
收藏
页码：18 / 28
页数：11
相关论文
共 50 条
  • [1] A New Lower Bound for Classic Online Bin Packing
    János Balogh
    József Békési
    György Dósa
    Leah Epstein
    Asaf Levin
    [J]. Algorithmica, 2021, 83 : 2047 - 2062
  • [2] A New Lower Bound for Classic Online Bin Packing
    Balogh, Janos
    Bekesi, Jozsef
    Dosa, Gyorgy
    Epstein, Leah
    Levin, Asaf
    [J]. ALGORITHMICA, 2021, 83 (07) : 2047 - 2062
  • [3] A LOWER BOUND FOR ONLINE BIN PACKING
    LIANG, FM
    [J]. INFORMATION PROCESSING LETTERS, 1980, 10 (02) : 76 - 79
  • [4] AN IMPROVED LOWER BOUND FOR ONLINE BIN PACKING ALGORITHMS
    VANVLIET, A
    [J]. INFORMATION PROCESSING LETTERS, 1992, 43 (05) : 277 - 284
  • [5] PARAMETRIC LOWER BOUND FOR ONLINE BIN-PACKING
    GALAMBOS, G
    [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (03): : 362 - 367
  • [6] Lower bound for the online bin packing problem with restricted repacking
    Balogh, Janos
    Bekesi, Jozsef
    Galambos, Gabor
    Reinelt, Gerhard
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (01) : 398 - 410
  • [7] An 8/3 Lower Bound for Online Dynamic Bin Packing
    Wong, Prudence W. H.
    Yung, Fencol C. C.
    Burcea, Mihai
    [J]. ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 44 - 53
  • [8] A new lower bound on the price of anarchy of selfish bin packing
    Dosa, Gyorgy
    Epstein, Leah
    [J]. INFORMATION PROCESSING LETTERS, 2019, 150 : 6 - 12
  • [9] A new lower bound for online strip packing
    Yu, Guosong
    Mao, Yanling
    Xiao, Jiaoliao
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 250 (03) : 754 - 759
  • [10] A tight lower bound for the online bounded space hypercube bin packing problem
    Kohayakawa, Yoshiharu
    Miyazawa, Flavio Keidi
    Wakabayashi, Yoshiko
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (03):
12345