Lower Bounds for Several Online Variants of Bin Packing

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theory of computing systems Ročník 63; číslo 8; s. 1757 - 1780
Hlavní autoři: Balogh, János, Békési, József, Dósa, György, Epstein, Leah, Levin, Asaf
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.11.2019
Springer Nature B.V
Témata:
Asymptotic methods
Asymptotic properties
Computer Science
Lower bounds
Special Issue on Approximation and Online Algorithms
Theory of Computation
Bin packing
Online algorithms
Lower bounds
Competitive ratio
ISSN:1432-4350, 1433-0490
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-019-09915-1