Lower bounds for online bin covering-type problems

János Balogh (), Leah Epstein () and Asaf Levin ()
Additional contact information
János Balogh: University of Szeged
Leah Epstein: University of Haifa
Asaf Levin: The Technion

Journal of Scheduling, 2019, vol. 22, issue 4, No 8, 487-497

Abstract: 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$$ d ≥ 2 dimensions, for which our new lower bound is $$d+1$$ d + 1 , improving over the previously known lower bound of $$d+\frac{1}{2}$$ d + 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.

Keywords: Competitive analysis; Lower bounds; Bin covering (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-018-0590-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:22:y:2019:i:4:d:10.1007_s10951-018-0590-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-018-0590-0

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().