Online Bin Covering: Expectations vs. Guarantees

  title={Online Bin Covering: Expectations vs. Guarantees},
  author={Marie G. Christ and Lene M. Favrholdt and Kim S. Larsen},
  journal={Theor. Comput. Sci.},
Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total size at least one in the bin. For online bin covering, competitive analysis fails to distinguish between most algorithms of interest; all “reasonable” algorithms have a competitive ratio of 1 2 . Thus, in order to get a better understanding of the combinatorial difficulties in solving this problem, we turn to other performance measures… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 2 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-3 of 3 extracted citations

Adventures Between Lower Bounds and Higher Altitudes

Lecture Notes in Computer Science • 2018
View 5 Excerpts
Highly Influenced

Relative Worst-Order Analysis: A Survey

Adventures Between Lower Bounds and Higher Altitudes • 2018
View 1 Excerpt


Publications referenced by this paper.
Showing 1-10 of 32 references

Best-fit bin-packing with random order

SODA '96 • 1996
View 4 Excerpts
Highly Influenced

Online algorithms for a dual version of bin packing

Discrete Applied Mathematics • 1988
View 4 Excerpts
Highly Influenced

A Simple On-Line Bin-Packing Algorithm

J. ACM • 1985
View 9 Excerpts
Highly Influenced

Favrholdt , and Jens S . Kohrt . Comparing online algorithms for bin packing problems

Leah Epstein, M. Lene
Algorithmica • 2013

Similar Papers

Loading similar papers…