arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1002.2440cs.CCcs.DS
收藏

投影表更新算法的最优下界

Optimal Lower Bounds for Projective List Update Algorithms

Christoph Ambuehl, Bernd Gaertner, Bernhard von Stengel

摘要:

列表更新问题是一个经典的在线问题,其最优竞争比仍然是开放的,已知在1.5和1.6之间。竞争比为1.6的算法是迄今为止已知的最小的算法,它是BIT和TIMESTAMP算法TS的随机组合。这个和几乎所有其他列表更新算法,如MTF,都是投影的,因为它们可以通过一次只查看任何一对列表项来定义。投影性(也称为“列表分解”)简化了算法的描述和分析,到目前为止,似乎是定义任意长度列表的好的在线算法的唯一方法。在本文中,我们描述了所有的投影列表更新算法,并证明了它们的竞争比从来没有小于1.6的部分成本模型。因此,COMB是该模型中最好的投影算法。

英文摘要:

The list update problem is a classical online problem, with an optimal competitive ratio that is still open, known to be somewhere between 1.5 and 1.6. An algorithm with competitive ratio 1.6, the smallest known to date, is COMB, a randomized combination of BIT and the TIMESTAMP algorithm TS. This and almost all other list update algorithms, like MTF, are projective in the sense that they can be defined by looking only at any pair of list items at a time. Projectivity (also known as "list factoring") simplifies both the description of the algorithm and its analysis, and so far seems to be the only way to define a good online algorithm for lists of arbitrary length. In this paper we characterize all projective list update algorithms and show that their competitive ratio is never smaller than 1.6 in the partial cost model. Therefore, COMB is a best possible projective algorithm in this model.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑