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

稀疏网络下k-服务器问题的建议复杂性

On Advice Complexity of the k-server Problem under Sparse Metrics

Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz

摘要:

我们考虑的k-服务器问题下的建议模型的计算时,底层的度量空间是稀疏的。一方面,我们证明了对于大小为n的序列,甚至对于路径度量大小为N >= 5的2-服务器问题,需要大小为Ω(n)的建议来获得1-竞争算法。通过另一个下界论证,我们证明了树宽为α的度量空间至少需要(n/2)(log α - 1.22)比特的建议才能得到最优解,其中4 <= α < 2k.在另一方面,我们介绍了广泛的稀疏图,这需要(几乎)线性大小的建议的Θ(1)-竞争算法。也就是说,我们表明,对于图的大小N和树宽α,有一个在线算法,接收$O(n (log α + log log N))$位的意见,并最佳地提供一个序列的长度为n。用另一种方法证明了:如果一个图有一个μ-集合树(q,r)-空间系统,则存在一个(q+r)-竞争算法,它接收O(n(log μ + log log N))比特的建议.在其他结果中,这给出了平面图的3-竞争算法,提供O(n log log N)位的建议。

英文摘要:

We consider the k-server problem under the advice model of computation when the underlying metric space is sparse. On one side, we show that an advice of size Ω(n) is required to obtain a 1-competitive algorithm for sequences of size n, even for the 2-server problem on a path metric of size N >= 5. Through another lower bound argument, we show that at least (n/2)(log α - 1.22) bits of advice is required to obtain an optimal solution for metric spaces of treewidth α, where 4 <= α < 2k. On the other side, we introduce Θ(1)-competitive algorithms for a wide range of sparse graphs, which require advice of (almost) linear size. Namely, we show that for graphs of size N and treewidth α, there is an online algorithm which receives $O(n (log α + log log N))$ bits of advice and optimally serves a sequence of length n. With a different argument, we show that if a graph admits a system of μ collective tree (q,r)-spanners, then there is a (q+r)-competitive algorithm which receives O(n (log μ + log log N)) bits of advice. Among other results, this gives a 3-competitive algorithm for planar graphs, provided with O(n log log N) bits of advice.

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

↑