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

固定有限时间内k-服务台问题的竞争比逼近格式

A Competitive Ratio Approximation Scheme for the k-Server Problem in Fixed Finite Metrics

Tobias Mömke

摘要:

我们将展示如何限制分析一类在线问题,其中包括$k$服务器的问题,在有限度量,这样我们只需要考虑有限序列的请求。当应用限制时,最优离线解和最佳可能的确定性或随机化在线解与无限制的相应解之间的差异最多仅为任意小的常数因子。此外,我们展示了如何获得一个算法,最好的确定性或随机竞争比的限制设置。因此,对于每个固定的有限度量,我们的结果符合Günther等人定义的竞争比近似方案的资格。

英文摘要:

We show how to restrict the analysis of a class of online problems that includes the $k$-server problem in finite metrics such that we only have to consider finite sequences of request. When applying the restrictions, both the optimal offline solutions and the best possible deterministic or randomized online solutions only differ by at most an arbitrarily small constant factor from the corresponding solutions without restrictions. Furthermore, we show how to obtain an algorithm with best possible deterministic or randomized competitive ratio for the restricted setup. Thus, for each fixed finite metrics our result qualifies as a competitive ratio approximation scheme as defined by Günther et al.

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

↑