不可分割的转运问题
Unsplittable Transshipments
AI总结:
该研究提出了一种将给定转运转换为不可分割转运的方法,通过保证每条弧的流量不超过原流量与最大需求之和,并给出了满足需求所需的轮次上限。
摘要:
我们介绍了在有向图中具有多个源和汇的不可分割转运问题。不可分割转运使用每个源-汇对至多一条路径来路由给定的供应和需求。尽管它们是单一源不可分割流的自然推广,不可分割转运提出了有趣的新挑战,并需要新的算法技术。我们的主要贡献是通过展示如何高效地将给定的转运x转换为不可分割的转运y,其中对于所有弧a,y_a < x_a + d_max,其中d_max是最大需求(或供应)值,对Dinitz、Garg和Goemans(1999)的奠基性结果进行了非平凡的推广。进一步的结果包括满足所有需求所需轮次的数量界,其中每个轮次由一个不可分割转运组成,该转运路由部分需求并尊重弧容量约束。
英文摘要:
We introduce the Unsplittable Transshipment Problem in directed graphs with multiple sources and sinks. An unsplittable transshipment routes given supplies and demands using at most one path for each source-sink pair. Although they are a natural generalization of single source unsplittable flows, unsplittable transshipments raise interesting new challenges and require novel algorithmic techniques. As our main contribution, we give a nontrivial generalization of a seminal result of Dinitz, Garg, and Goemans (1999) by showing how to efficiently turn a given transshipment $x$ into an unsplittable transshipment $y$ with $y_a<x_a+d_{\max}$ for all arcs $a$, where $d_{\max}$ is the maximum demand (or supply) value. Further results include bounds on the number of rounds required to satisfy all demands, where each round consists of an unsplittable transshipment that routes a subset of the demands while respecting arc capacity constraints.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。