2017
DOI: 10.1007/s10951-016-0504-y
|View full text |Cite
|
Sign up to set email alerts
|

Online bin stretching with three bins

Abstract: Abstract. Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of 11/8 = 1.375 for three bins. Additionally, we present a lower bound of 45/33 = 1.36 for Online Bin Stretching on three bins and a lower bound of 1… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
11
0
1

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 15 publications
1
11
0
1
Order By: Relevance
“…Indeed, (7) together with (6) yields w(A) + w(A) ≥ −5 and summing this with all the other bounds, namely w(F) > 5 from Lemma 2.13 and w(B i ) ≥ 0 for whole blocks B i ∈ D from Lemma 2.15, leads to w(L) > 0, which is a contradiction. Now we prove (7). The items n and n from A together with the first two special bins in A have size more than 36.…”
Section: Lemma 214mentioning
confidence: 94%
See 4 more Smart Citations
“…Indeed, (7) together with (6) yields w(A) + w(A) ≥ −5 and summing this with all the other bounds, namely w(F) > 5 from Lemma 2.13 and w(B i ) ≥ 0 for whole blocks B i ∈ D from Lemma 2.15, leads to w(L) > 0, which is a contradiction. Now we prove (7). The items n and n from A together with the first two special bins in A have size more than 36.…”
Section: Lemma 214mentioning
confidence: 94%
“…The paper of Gabay et al [10] showed a lower bound of 19/14 ≈ 1.357 for m = 3 using a computer search. Extending their methods, the authors of this paper were able to reach a lower bound of 15/11 = 1.36 for m = 3 in [7] as well as a bound of 19/14 for m = 4 and m = 5. The preprint [10] was updated in 2015 [11] to include a lower bound of 19/14 for m = 4 bins.…”
Section: Introductionmentioning
confidence: 91%
See 3 more Smart Citations