IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v21y2011i1d10.1007_s10878-009-9246-5.html
   My bibliography  Save this article

New algorithms for online rectangle filling with k-lookahead

Author

Listed:
  • Haitao Wang

    (University of Notre Dame)

  • Amitabh Chaudhary

    (University of Notre Dame)

  • Danny Z. Chen

    (University of Notre Dame)

Abstract

We study the online rectangle filling problem which arises in channel aware scheduling of wireless networks, and present deterministic and randomized results for algorithms that are allowed a k-lookahead for k≥2. Our main result is a deterministic min {1.848,1+2/(k−1)}-competitive online algorithm. This is the first algorithm for this problem with a competitive ratio approaching 1 as k approaches +∞. The previous best-known solution for this problem has a competitive ratio of 2 for any k≥2. We also present a randomized online algorithm with a competitive ratio of 1+1/(k+1). Our final result is a closely matching lower bound (also proved in this paper) of $1+1/(\sqrt{k+2}+\sqrt{k+1})^{2}>1+1/(4(k+2))$ on the competitive ratio of any randomized online algorithm against an oblivious adversary. These are the first known results for randomized algorithms for this problem.

Suggested Citation

  • Haitao Wang & Amitabh Chaudhary & Danny Z. Chen, 2011. "New algorithms for online rectangle filling with k-lookahead," Journal of Combinatorial Optimization, Springer, vol. 21(1), pages 67-82, January.
    • Handle: RePEc:spr:jcomop:v:21:y:2011:i:1:d:10.1007_s10878-009-9246-5
    DOI: 10.1007/s10878-009-9246-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9246-5
    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/s10878-009-9246-5?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:jcomop:v:21:y:2011:i:1:d:10.1007_s10878-009-9246-5. 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.