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

低步数多商品流模拟器

Low-Step Multi-Commodity Flow Emulators

Bernhard Haeupler, D Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak

AI总结:

该研究提出低步数多商品流模拟器概念并证明其存在性,开发高效计算算法,以此在O((m+k)^(1+ε))时间内求解常数近似k-商品流,还可推广至最小成本场景且算法支持并行。

摘要:

我们针对任意无向带容量图提出了低步数多商品流模拟器的概念。大体而言,这类模拟器包含近似多商品流,其路径仅含少量边,打破了多商品流领域中著名的流分解壁垒。\n我们证明了低步数多商品流模拟器的存在性,并开发了计算这类模拟器的高效算法。随后我们将其用于求解常数近似k-商品流,时间复杂度为O((m+k)^(1+ε))。为绕过O(mk)的流分解壁垒,我们以隐式方式表示输出的多商品流;在我们的工作之前,规模为o(mk)的隐式常数近似多商品流是否存在都尚不明确。\n我们的结果可推广至最小成本场景,即每条边都有对应成本,且多商品流必须满足成本预算约束。我们的算法也支持并行运行。

英文摘要:

We introduce the concept of low-step multi-commodity flow emulators for any undirected, capacitated graph. At a high level, these emulators contain approximate multi-commodity flows whose paths contain a small number of edges, shattering the infamous flow decomposition barrier for multi-commodity flow. We prove the existence of low-step multi-commodity flow emulators and develop efficient algorithms to compute them. We then apply them to solve constant-approximate $k$-commodity flow in $O((m+k)^{1+ε})$ time. To bypass the $O(mk)$ flow decomposition barrier, we represent our output multi-commodity flow implicitly; prior to our work, even the existence of implicit constant-approximate multi-commodity flows of size $o(mk)$ was unknown. Our results generalize to the minimum cost setting, where each edge has an associated cost and the multi-commodity flow must satisfy a cost budget. Our algorithms are also parallel.

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

↑