IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v22y2019i4d10.1007_s10951-018-0590-0.html
   My bibliography  Save this article

Lower bounds for online bin covering-type problems

Author

Listed:
  • János Balogh

    (University of Szeged)

  • Leah Epstein

    (University of Haifa)

  • Asaf Levin

    (The Technion)

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.

Suggested Citation

  • János Balogh & Leah Epstein & Asaf Levin, 2019. "Lower bounds for online bin covering-type problems," Journal of Scheduling, Springer, vol. 22(4), pages 487-497, August.
    • Handle: RePEc:spr:jsched:v:22:y:2019:i:4:d:10.1007_s10951-018-0590-0
    DOI: 10.1007/s10951-018-0590-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-018-0590-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-018-0590-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:22:y:2019:i:4:d:10.1007_s10951-018-0590-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.