arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.5973cs.DSmath.CO
收藏

区分层次和通用集线器标签

Separating Hierarchical and General Hub Labelings

Andrew V. Goldberg, Ilya Razenshteyn, Ruslan Savchenko

摘要:

在距离预言机的上下文中,标记算法在预处理期间计算顶点标记。$s,t$查询仅计算与$s$和$t$标签的对应距离,而不查看输入图。枢纽标签是一类已被广泛研究的标签。中心标签查询的性能取决于标签大小。层次标签是一种自然的特殊类型的枢纽标签。这些标签与其他问题有关,可以更有效地计算。这就自然地提出了层次标签的质量问题。我们发现,有一个差距:最佳层次标签可以多项式大于一般枢纽标签。为了证明这一结果,我们给出了严格的上界和下界的超立方体的层次和一般标签的大小。

英文摘要:

In the context of distance oracles, a labeling algorithm computes vertex labels during preprocessing. An $s,t$ query computes the corresponding distance from the labels of $s$ and $t$ only, without looking at the input graph. Hub labels is a class of labels that has been extensively studied. Performance of the hub label query depends on the label size. Hierarchical labels are a natural special kind of hub labels. These labels are related to other problems and can be computed more efficiently. This brings up a natural question of the quality of hierarchical labels. We show that there is a gap: optimal hierarchical labels can be polynomially bigger than the general hub labels. To prove this result, we give tight upper and lower bounds on the size of hierarchical and general labels for hypercubes.

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

↑