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

高需求的线上多商品流

Online Multi-Commodity Flow with High Demands

Guy Even, Moti Medina

摘要:

本文讨论了在网络中以在线方式计算最大效益多商品流(\ONMCF)的问题,其中流的需求可能大于网络的边容量。我们提出了一个在线的,确定性的,集中的,全有或全无,双标准算法。该算法的竞争比是常数,并且该算法的容量最多增加一个对数因子。该算法可以处理两种类型的流请求:(i)必须沿着路径路由的低需求请求,以及(ii)可以使用多路径流路由的高需求请求。两个扩展进行了讨论:请求与已知的持续时间和机器调度。

英文摘要:

This paper deals with the problem of computing, in an online fashion, a maximum benefit multi-commodity flow (\ONMCF), where the flow demands may be bigger than the edge capacities of the network. We present an online, deterministic, centralized, all-or-nothing, bi-criteria algorithm. The competitive ratio of the algorithm is constant, and the algorithm augments the capacities by at most a logarithmic factor. The algorithm can handle two types of flow requests: (i) low demand requests that must be routed along a path, and (ii) high demand requests that may be routed using a multi-path flow. Two extensions are discussed: requests with known durations and machine scheduling.

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

↑