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

可定制的集线器标签:属性和算法

Customizable Hub Labeling: Properties and Algorithms

Johannes Blum, Sabine Storandt

摘要:

枢纽标记是一种基于预处理的道路网路径规划方法。它是距离标注的一种特殊体现,在理论和实践上都得到了很好的研究。HL的核心概念是将标签与每个顶点相关联,该标签由所有顶点的子集和各自的最短路径信息组成,使得任何两个顶点之间的最短路径距离可以通过考虑它们的标签的交集来导出。HL提供了出色的查询时间,但需要一个耗时的预处理阶段。因此,在边缘成本改变的情况下,重新运行整个预处理是不可行的。受可定制路线规划概念的启发,我们在本文中提出了一种可定制的枢纽标签变体,其网络中的边成本不需要在构建时已知。然后,在进行所谓的定制阶段之后,这些标签可以以任何边缘成本使用。研究了可定制集线器标签的理论性质,给出了平均标签大小的$\mathcal{O}(\log^2 n)$ -近似算法,并提出了有效的定制算法。

英文摘要:

Hub Labeling (HL) is one of the state-of-the-art preprocessing-based techniques for route planning in road networks. It is a special incarnation of distance labeling, and it is well-studied in both theory and practice. The core concept of HL is to associate a label with each vertex, which consists of a subset of all vertices and respective shortest path information, such that the shortest path distance between any two vertices can be derived from considering the intersection of their labels. HL provides excellent query times but requires a time-consuming preprocessing phase. Therefore, in case of edge cost changes, rerunning the whole preprocessing is not viable. Inspired by the concept of Customizable Route Planning, we hence propose in this paper a Customizable Hub Labeling variant for which the edge costs in the network do not need to be known at construction time. These labels can then be used with any edge costs after conducting a so called customization phase. We study the theoretical properties of Customizable Hub Labelings, provide an $\mathcal{O}(\log^2 n)$-approximation algorithm for the average label size, and propose efficient customization algorithms.

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

↑