最优扩径路径与树的快速算法
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
摘要:
我们考虑的问题,增加一个n-顶点图嵌入在度量空间中,通过插入一个额外的边缘,以最小化所得到的图的直径。我们提出了精确的算法的情况下,(i)输入图是一条路,运行在O(n \log^3 n)的时间,和(ii)输入图是一棵树,运行在O(n^2 \log n)的时间。我们还提出了一个算法,计算一个(1+ \eps)-近似在O(n + 1/ \eps^3)的时间,路径在R^d,其中d是一个常数。
英文摘要:
We consider the problem of augmenting an n-vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the resulting graph. We present exact algorithms for the cases when (i) the input graph is a path, running in O(n \log^3 n) time, and (ii) the input graph is a tree, running in O(n^2 \log n) time. We also present an algorithm that computes a (1+\eps)-approximation in O(n + 1/\eps^3) time, for paths in R^d, where d is a constant.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。