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/978-3-319-89441-6_9

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: Chapter in Book/Report/Conference proceeding › Conference contribution › 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
Title of host publication	Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers
Editors	Roberto Solis-Oba, Rudolf Fleischer
Publisher	Springer Verlag
Pages	102-117
Number of pages	16
ISBN (Print)	9783319894409
DOIs	https://doi.org/10.1007/978-3-319-89441-6_9
State	Published - 2018
Event	15th Workshop on Approximation and Online Algorithms, WAOA 2017 - Vienna, Austria Duration: 7 Sep 2017 → 8 Sep 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10787 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th Workshop on Approximation and Online Algorithms, WAOA 2017
Country/Territory	Austria
City	Vienna
Period	7/09/17 → 8/09/17

Bibliographical note

Publisher Copyright:
© Springer International Publishing AG, part of Springer Nature 2018.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-89441-6_9

Cite this

Balogh, J., Békési, J., Dósa, G., Epstein, L., & Levin, A. (2018). Lower bounds for several online variants of bin packing. In R. Solis-Oba, & R. Fleischer (Eds.), Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers (pp. 102-117). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10787 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-89441-6_9

Balogh, János ; Békési, József ; Dósa, György et al. / Lower bounds for several online variants of bin packing. Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. editor / Roberto Solis-Oba ; Rudolf Fleischer. Springer Verlag, 2018. pp. 102-117 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6f8da209613e404c849505e3e806a708,

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.",

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 = "Publisher Copyright: {\textcopyright} Springer International Publishing AG, part of Springer Nature 2018.; 15th Workshop on Approximation and Online Algorithms, WAOA 2017 ; Conference date: 07-09-2017 Through 08-09-2017",

year = "2018",

doi = "10.1007/978-3-319-89441-6_9",

language = "English",

isbn = "9783319894409",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "102--117",

editor = "Roberto Solis-Oba and Rudolf Fleischer",

booktitle = "Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers",

address = "Germany",

}

Balogh, J, Békési, J, Dósa, G, Epstein, L & Levin, A 2018, Lower bounds for several online variants of bin packing. in R Solis-Oba & R Fleischer (eds), Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10787 LNCS, Springer Verlag, pp. 102-117, 15th Workshop on Approximation and Online Algorithms, WAOA 2017, Vienna, Austria, 7/09/17. https://doi.org/10.1007/978-3-319-89441-6_9

Lower bounds for several online variants of bin packing. / Balogh, János; Békési, József; Dósa, György et al.
Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. ed. / Roberto Solis-Oba; Rudolf Fleischer. Springer Verlag, 2018. p. 102-117 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10787 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

PY - 2018

Y1 - 2018

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.

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

U2 - 10.1007/978-3-319-89441-6_9

DO - 10.1007/978-3-319-89441-6_9

M3 - Conference contribution

AN - SCOPUS:85045981897

SN - 9783319894409

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 102

EP - 117

BT - Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers

A2 - Solis-Oba, Roberto

A2 - Fleischer, Rudolf

PB - Springer Verlag

T2 - 15th Workshop on Approximation and Online Algorithms, WAOA 2017

Y2 - 7 September 2017 through 8 September 2017

ER -

Balogh J, Békési J, Dósa G, Epstein L, Levin A. Lower bounds for several online variants of bin packing. In Solis-Oba R, Fleischer R, editors, Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. Springer Verlag. 2018. p. 102-117. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-89441-6_9

Lower bounds for several online variants of bin packing

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this