当前位置:
X-MOL 学术
›
Theor. Comput. Sci.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Minsum k-sink problem on path networks
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2019-07-19 , DOI: 10.1016/j.tcs.2019.05.047 Robert Benkoczi , Binay Bhattacharya , Yuya Higashikawa , Tsunehiko Kameda , Naoki Katoh
中文翻译:
路径网络上的最小和-k汇问题
更新日期:2019-07-19
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2019-07-19 , DOI: 10.1016/j.tcs.2019.05.047 Robert Benkoczi , Binay Bhattacharya , Yuya Higashikawa , Tsunehiko Kameda , Naoki Katoh
We consider the problem of locating a set of k sinks on a path network with general edge capacities that minimizes the sum of the evacuation times of all evacuees. We first present an time algorithm when the edge capacities are non-uniform, where n is the number of vertices. We then present an time algorithm when the edge capacities are uniform. We also present an time algorithm for the special case where and the edge capacities are non-uniform.
中文翻译:
路径网络上的最小和-k汇问题
我们考虑的问题是,在具有一般边缘容量的路径网络上定位一组k个汇点,以最大程度地减少所有撤离人员的疏散时间之和。我们首先提出一个边容量不均匀时的时间算法,其中n是顶点数。然后,我们提出一个边缘容量均匀的时间算法。我们还提出了一个 特殊情况下的时间算法 并且边缘容量不均匀。