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

关于泛近最短简单路问题

On the Universal Near Shortest Simple Paths Problem

Luca E. Schäfer, Andrea Maier, Stefan Ruzika

摘要:

本文利用Turner和Hamacher在2011年提出的通用最短路问题的概念,推广了Byers和Waterman在1984年提出的近最短路问题。通过引入一个通用的权向量,推广到了各种最短路问题。我们将这个概念应用到近最短路径问题的方式,我们能够枚举所有通用的近最短简单路径。我们提出了两个递归算法来计算两个预先指定的顶点之间的通用近最短简单路径的集合,并评估每个路径的运行时间复杂度枚举相对于不同的值的通用权向量。进一步,我们研究了极小完备集关于不同泛权向量值的基数。

英文摘要:

This article generalizes the Near Shortest Paths Problem introduced by Byers and Waterman in 1984 using concepts of the Universal Shortest Path Problem established by Turner and Hamacher in 2011. The generalization covers a variety of shortest path problems by introducing a universal weight vector. We apply this concept to the Near Shortest Paths Problem in a way that we are able to enumerate all universal near shortest simple paths. We present two recursive algorithms to compute the set of universal near shortest simple paths between two prespecified vertices and evaluate the running time complexity per path enumerated with respect to different values of the universal weight vector. Further, we study the cardinality of a minimal complete set with respect to different values of the universal weight vector.

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

↑