最近共同祖先的近优标号方案
Near-optimal labeling schemes for nearest common ancestors
摘要:
我们考虑NCA标签计划:给定一个有根树$T$,标签的节点$T$与二进制字符串,这样,给定的标签的任何两个节点,可以确定,只看标签,标签的最近的共同祖先。对于树的$n$节点,我们提出了上限和下限建立标签的大小$(2\pm ε)\log n$,$ε<1$是充分和必要的。(All本文的计算公式是以2为基数的。Alstrup、Bille和Rauhe(SIMMA '05)表明,祖先和NCA标记方案具有大小为$\log n +Ω(\log \log n)$的标记。对于NCA标记方案,我们的下限将其增加到$\log n + Ω(\log n)$。由于Fraigniaud和Korman(STOC'10)建立了祖先标记方案中的标签具有大小$\log n +Θ(\log \log n)$,因此我们的新下限将祖先和NCA标记方案分开。我们的上限改进了Alstrup,Gavoille,Kaplan和Rauhe(TOCS'04)的$10 \log n$上限,我们的理论结果甚至优于Fischer(ESA'09)最近的一些实验研究,其中相同NCA标记方案的变体都显示具有大小约为$8 \log n$的标记。
英文摘要:
We consider NCA labeling schemes: given a rooted tree $T$, label the nodes of $T$ with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the label of their nearest common ancestor. For trees with $n$ nodes we present upper and lower bounds establishing that labels of size $(2\pm ε)\log n$, $ε<1$ are both sufficient and necessary. (All logarithms in this paper are in base 2.) Alstrup, Bille, and Rauhe (SIDMA'05) showed that ancestor and NCA labeling schemes have labels of size $\log n +Ω(\log \log n)$. Our lower bound increases this to $\log n + Ω(\log n)$ for NCA labeling schemes. Since Fraigniaud and Korman (STOC'10) established that labels in ancestor labeling schemes have size $\log n +Θ(\log \log n)$, our new lower bound separates ancestor and NCA labeling schemes. Our upper bound improves the $10 \log n$ upper bound by Alstrup, Gavoille, Kaplan and Rauhe (TOCS'04), and our theoretical result even outperforms some recent experimental studies by Fischer (ESA'09) where variants of the same NCA labeling scheme are shown to all have labels of size approximately $8 \log n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。