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

具有一般边容量的动态路径上的最优疏散流

Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities

Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Yuya Higashikawa, Naoki Katoh, Prashanth Srikanthan

摘要:

动态图网络是一个图,其中每个边都有一个相关的旅行时间和一个容量(宽度),限制了可以沿着该边并行旅行的项目数量。这个动态图网络中的每个顶点都以必须疏散到指定汇点的项目数开始。$k$ -水槽疏散协议查找$k$水槽的位置以及允许在最短时间内将所有物品疏散到水槽的关联疏散移动协议。相关的疏散运动必须施加一个汇合流,即所有通过一个特定顶点的物品使用同一条边离开该顶点。在本文中,我们解决了$k$ -汇疏散问题的动态路径网络。我们提供的解决方案可在$O(n \log n)$时间内运行$k=1$和$k >1$,并适用于任意边缘容量。

英文摘要:

A Dynamic Graph Network is a graph in which each edge has an associated travel time and a capacity (width) that limits the number of items that can travel in parallel along that edge. Each vertex in this dynamic graph network begins with the number of items that must be evacuated into designated sink vertices. A $k$-sink evacuation protocol finds the location of $k$ sinks and associated evacuation movement protocol that allows evacuating all the items to a sink in minimum time. The associated evacuation movement must impose a confluent flow, i.e, all items passing through a particular vertex exit that vertex using the same edge. In this paper we address the $k$-sink evacuation problem on a dynamic path network. We provide solutions that run in $O(n \log n)$ time for $k=1$ and $O(k n \log^2 n)$ for $k >1$ and work for arbitrary edge capacities.

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

↑