An Improved Algorithm for Online Rectangle Filling

被引:0
|
作者
van Stee, Rob [1 ]
机构
[1] Max Planck Inst Informat, D-66123 Saarbrucken, Germany
来源
APPROXIMATION AND ONLINE ALGORITHMS | 2011年 / 6534卷
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider the problem of scheduling resource allocation where a change in allocation results in a changeover penalty of one time slot. We assume that we are sending packets over a wireless channel of uncertain and varying capacity. In each time slot, a bandwidth of at most the current capacity can be allocated, but changing the capacity has a. cost, which is modeled as an empty time slot. Only the current bandwidth and the bandwidth of the immediately following slot are known. We give an online algorithm with competitive ratio 1.753 for this problem, improving over the previous upper bound of 1.848. The main new idea of our algorithm is that it attempts to avoid cases where a single time slot with a nonzero allocation is immediately followed by an empty time slot. Additionally, we improve the lower bound for this problem to 1.6959. Our results significantly narrow the gap between the best known upper and lower bound.
引用
收藏
页码:249 / 260
页数:12
相关论文
共 50 条
  • [1] An improved algorithm for online rectangle filling
    van Stee, Rob
    THEORETICAL COMPUTER SCIENCE, 2012, 423 : 59 - 74
  • [2] Online rectangle filling
    Wang, Haitao
    Chaudhary, Amitabh
    Chen, Danny Z.
    APPROXIMATION AND ONLINE ALGORITHMS, 2008, 4927 : 274 - 287
  • [3] Online rectangle filling
    Wang, Haitao
    Chaudhary, Amitabh
    Chen, Danny Z.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5247 - 5275
  • [4] New algorithms for online rectangle filling with k-lookahead
    Wang, Haitao
    Chaudhary, Amitabh
    Chen, Danny Z.
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008, 5092 : 385 - 394
  • [5] AN IMPROVED ALGORITHM FOR THE RECTANGLE ENCLOSURE PROBLEM
    LEE, DT
    PREPARATA, FP
    JOURNAL OF ALGORITHMS, 1982, 3 (03) : 218 - 224
  • [6] New algorithms for online rectangle filling with k-lookahead
    Wang, Haitao
    Chaudhary, Amitabh
    Chen, Danny Z.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 21 (01) : 67 - 82
  • [7] New algorithms for online rectangle filling with k-lookahead
    Haitao Wang
    Amitabh Chaudhary
    Danny Z. Chen
    Journal of Combinatorial Optimization, 2011, 21 : 67 - 82
  • [8] An improved improved algorithm for online machine minimization
    Azar, Yossi
    Cohen, Sarel
    OPERATIONS RESEARCH LETTERS, 2018, 46 (01) : 128 - 133
  • [9] Improved Rectangle Template Matching Based Feature Point Matching Algorithm
    Liu, Zhiyuan
    Guo, Yanning
    Feng, Zhen
    Zhang, Shaojiang
    PROCEEDINGS OF THE 2019 31ST CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2019), 2019, : 2275 - 2280
  • [10] An Improved Algorithm for Online Unit Clustering
    Hamid Zarrabi-Zadeh
    Timothy M. Chan
    Algorithmica, 2009, 54 : 490 - 500