3 years ago

# Lower bounds for online bin covering-type problems

János Balogh, Leah Epstein, Asaf Levin

### Abstract

We study several variants of bin covering and design lower bounds on the asymptotic competitive ratio of online algorithms for these problems. Our main result is for vector covering with $$d \ge 2$$ dimensions, for which our new lower bound is $$d+1$$ , improving over the previously known lower bound of $$d+\frac{1}{2}$$ , which was proved more than twenty years ago by Alon et al. Two special cases of vector covering are considered as well. We prove an improved lower bound of approximately 2.8228 for the asymptotic competitive ratio of the bin covering with cardinality constraints problem, and we also study vector covering with small components and show tight bounds of d for it. Finally, we define three models for one-dimensional black and white covering and show that no online algorithms of finite asymptotic competitive ratios can be designed for them.

DOI: 10.1007/s10951-018-0590-0

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.