Lower bounds for several online variants of bin packing

János Balogh, József Békési, G. Dósa, Leah Epstein, Asaf Levin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish
Title of host publicationApproximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers
PublisherSpringer Verlag
Pages102-117
Number of pages16
ISBN (Print)9783319894409
DOIs
Publication statusPublished - Jan 1 2018
Event15th Workshop on Approximation and Online Algorithms, WAOA 2017 - Vienna, Austria
Duration: Sep 7 2017Sep 8 2017

Publication series

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

Other

Other15th Workshop on Approximation and Online Algorithms, WAOA 2017
CountryAustria
CityVienna
Period9/7/179/8/17

Fingerprint

Bin Packing
Competitive Ratio
Bins
Lower bound
Packing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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 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

Lower bounds for several online variants of bin packing. / Balogh, János; Békési, József; Dósa, G.; Epstein, Leah; Levin, Asaf.

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); Vol. 10787 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Balogh, J, Békési, J, Dósa, G, Epstein, L & Levin, A 2018, Lower bounds for several online variants of bin packing. in 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, 9/7/17. https://doi.org/10.1007/978-3-319-89441-6_9
Balogh J, Békési J, Dósa G, Epstein L, Levin A. Lower bounds for several online variants of bin packing. In 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)). https://doi.org/10.1007/978-3-319-89441-6_9
Balogh, János ; Békési, József ; Dósa, G. ; Epstein, Leah ; Levin, Asaf. / Lower bounds for several online variants of bin packing. Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers. Springer Verlag, 2018. pp. 102-117 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{516ed3a509dc4b478c85eec4c1b509a8,
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 G. D{\'o}sa and Leah Epstein and Asaf Levin",
year = "2018",
month = "1",
day = "1",
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",
booktitle = "Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers",

}

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

AU - Epstein, Leah

AU - Levin, Asaf

PY - 2018/1/1

Y1 - 2018/1/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.

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

UR - http://www.scopus.com/inward/citedby.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

PB - Springer Verlag

ER -