arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2205.08103cs.DS
收藏

圆周上的确定性3-服务器与正则势的极限

Deterministic 3-Server on a Circle and the Limitation of Canonical Potentials

Zhiyi Huang, Hanwen Zhang

摘要:

确定性$k$ -服务器猜想指出,对于任何度量空间,存在$k$ -竞争确定性算法用于$k$ -服务器问题。我们证明了功函数算法对于圆度量上的$3$ -服务器问题是$3$ -竞争的,这是Coester和Koutsoupias(2021)留下的一个开放案例。我们的分析遵循现有的框架,但引入了一个新的势函数,该势函数可以被视为Coester和Koutsoupias(2021)的放松。我们进一步注意到,新的势函数和许多现有的可以重写的规范形式。然而,通过计算机辅助验证,我们发现在目前的分析框架下,没有这样的正则势函数能够解决一般度量空间的确定性$3$ -server猜想.

英文摘要:

The deterministic $k$-server conjecture states that there is a $k$-competitive deterministic algorithm for the $k$-server problem for any metric space. We show that the work function algorithm is $3$-competitive for the $3$-server problem on circle metrics, a case left open by Coester and Koutsoupias (2021). Our analysis follows the existing framework but introduces a new potential function which may be viewed as a relaxation of the counterpart by Coester and Koutsoupias (2021). We further notice that the new potential function and many existing ones can be rewritten in a canonical form. Through a computer-aided verification, however, we find that no such canonical potential function can resolve the deterministic $3$-server conjecture for general metric spaces under the current analysis framework.

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

↑