Lower Bounds for Several Online Variants of Bin Packing

János Balogh; József Békési; György Dósa; Leah Epstein; Asaf Levin

doi:10.1007/s00224-019-09915-1

Lower Bounds for Several Online Variants of Bin Packing

János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.

Original language	English
Pages (from-to)	1757-1780
Number of pages	24
Journal	Theory of Computing Systems
Volume	63
Issue number	8
DOIs	https://doi.org/10.1007/s00224-019-09915-1
State	Published - 1 Nov 2019

Bibliographical note

Funding Information:
An extended abstract version appears in the Proceedings of WAOA2017. J. Balogh was supported by the project “Integrated program for training new generation of scientists in the fields of computer science”, no. EFOP-3.6.3-VEKOP-16-2017-0002. J. Békési was supported by the EU-funded Hungarian grant EFOP-3.6.2-16-2017-00015. Gy. Dósa was supported by Szechenyi 2020 under the EFOP-3.6.1-16-2016-00015 and by National Research, Development and Innovation Office NKFIH under the grant SNN 116095. L. Epstein and A. Levin were partially supported by a grant from GIF - the German-Israeli Foundation for Scientific Research and Development (grant number I-1366-407.6/2016).

Publisher Copyright:
© 2019, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords

Bin packing
Competitive ratio
Lower bounds
Online algorithms

ASJC Scopus subject areas

Theoretical Computer Science
Computational Theory and Mathematics

Access to Document

10.1007/s00224-019-09915-1

Cite this

@article{54bf14c53a1546d3adea24a2b6fe8234,

title = "Lower Bounds for Several Online Variants of Bin Packing",

abstract = "We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.",

keywords = "Bin packing, Competitive ratio, Lower bounds, Online algorithms",

author = "J{\'a}nos Balogh and J{\'o}zsef B{\'e}k{\'e}si and Gy{\"o}rgy D{\'o}sa and Leah Epstein and Asaf Levin",

note = "Funding Information: An extended abstract version appears in the Proceedings of WAOA2017. J. Balogh was supported by the project “Integrated program for training new generation of scientists in the fields of computer science”, no. EFOP-3.6.3-VEKOP-16-2017-0002. J. B{\'e}k{\'e}si was supported by the EU-funded Hungarian grant EFOP-3.6.2-16-2017-00015. Gy. D{\'o}sa was supported by Szechenyi 2020 under the EFOP-3.6.1-16-2016-00015 and by National Research, Development and Innovation Office NKFIH under the grant SNN 116095. L. Epstein and A. Levin were partially supported by a grant from GIF - the German-Israeli Foundation for Scientific Research and Development (grant number I-1366-407.6/2016). Publisher Copyright: {\textcopyright} 2019, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2019",

month = nov,

day = "1",

doi = "10.1007/s00224-019-09915-1",

language = "English",

volume = "63",

pages = "1757--1780",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "8",

}

TY - JOUR

T1 - Lower Bounds for Several Online Variants of Bin Packing

AU - Balogh, János

AU - Békési, József

AU - Dósa, György

AU - Epstein, Leah

AU - Levin, Asaf

N1 - Funding Information: An extended abstract version appears in the Proceedings of WAOA2017. J. Balogh was supported by the project “Integrated program for training new generation of scientists in the fields of computer science”, no. EFOP-3.6.3-VEKOP-16-2017-0002. J. Békési was supported by the EU-funded Hungarian grant EFOP-3.6.2-16-2017-00015. Gy. Dósa was supported by Szechenyi 2020 under the EFOP-3.6.1-16-2016-00015 and by National Research, Development and Innovation Office NKFIH under the grant SNN 116095. L. Epstein and A. Levin were partially supported by a grant from GIF - the German-Israeli Foundation for Scientific Research and Development (grant number I-1366-407.6/2016). Publisher Copyright: © 2019, Springer Science+Business Media, LLC, part of Springer Nature.

PY - 2019/11/1

Y1 - 2019/11/1

N2 - We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.

AB - We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.

KW - Bin packing

KW - Competitive ratio

KW - Lower bounds

KW - Online algorithms

UR - http://www.scopus.com/inward/record.url?scp=85062784086&partnerID=8YFLogxK

U2 - 10.1007/s00224-019-09915-1

DO - 10.1007/s00224-019-09915-1

M3 - Article

AN - SCOPUS:85062784086

SN - 1432-4350

VL - 63

SP - 1757

EP - 1780

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 8

ER -

Lower Bounds for Several Online Variants of Bin Packing

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this