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

动态路径网络上计算$k$ -Sink的改进算法

Improved Algorithms for Computing $k$-Sink on Dynamic Path Networks

Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

摘要:

我们提出了一种新的方法来寻找$k$ -sink的动态路径网络一般的边缘容量。我们的第一个算法在$O(n \log n + k^2 \log^4 n)$时间内运行,其中$n$是给定路径上的顶点数,我们的第二个算法在$O(n \log^3 n)$时间内运行。总之,它们改进了Arumugam等人提出的针对所有$k$值的先前最有效的$O(kn \log^2 n)$时间算法。在所有的边缘具有相同的容量的情况下,我们再次提出了两个算法,运行在$O(n + k^2 \log^2n)$时间和$O(n \log n)$时间,分别,和他们一起改善了以前最好的$O(kn)$时间算法由于Higashikawa等人。对于所有值的$k$。

英文摘要:

We present a novel approach to finding the $k$-sink on dynamic path networks with general edge capacities. Our first algorithm runs in $O(n \log n + k^2 \log^4 n)$ time, where $n$ is the number of vertices on the given path, and our second algorithm runs in $O(n \log^3 n)$ time. Together, they improve upon the previously most efficient $O(kn \log^2 n)$ time algorithm due to Arumugam et al. for all values of $k$. In the case where all the edges have the same capacity, we again present two algorithms that run in $O(n + k^2 \log^2n)$ time and $O(n \log n)$ time, respectively, and they together improve upon the previously best $O(kn)$ time algorithm due to Higashikawa et al. for all values of $k$.

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

↑