通过迭代细化实现高精度多商品流
High-Accuracy Multicommodity Flows via Iterative Refinement
AI总结:
本文提出首个 ℓ_{q,p}-范数最小化迭代细化框架,将无向图多商品流残差问题分解为可近线性求解的单商品凸流问题,从而获得快于通用 LP 求解器的高精度 (1+ε) 算法。
摘要:
多商品流问题是网络流与组合优化中的经典问题,应用于交通、通信、物流和供应链管理等领域。现有算法通常聚焦于低精度近似解,而高精度算法一般依赖通用线性规划求解器。本文针对无向图上一大类多商品流问题提出高效的高精度算法,并证明其运行时间优于通用线性规划求解器。主要结果表明,我们能够在时间 O_{q,p}(m^{1+o(1)} k^2 log(1/ε)) 内将 ℓ_{q,p}-范数多商品流问题求解至 (1+ε) 近似,其中 k 是商品数量,O_{q,p}(·) 隐藏仅依赖于 q 或 p 的常数。当 q 和 p 分别趋近于 1 和无穷大时,ℓ_{q,p}-范数流趋近于最大并发流。我们引入了首个面向 ℓ_{q,p}-范数最小化问题的迭代细化框架,该框架将问题归约为求解一系列可分解的残差问题。在 k 商品流情形中,每个残差问题都可分解为 k 个单商品凸流问题,而每个问题都能在近似线性时间内求解。鉴于许多经典多商品流变体在高精度区间已被证明对线性规划是完全的(Ding-Kyng-Zhang,ICALP’22),本结果为研究更高效的高精度多商品流算法提供了新方向。
英文摘要:
The multicommodity flow problem is a classic problem in network flow and combinatorial optimization, with applications in transportation, communication, logistics, and supply chain management, etc. Existing algorithms often focus on low-accuracy approximate solutions, while high-accuracy algorithms typically rely on general linear program solvers. In this paper, we present efficient high-accuracy algorithms for a broad family of multicommodity flow problems on undirected graphs, demonstrating improved running times compared to general linear program solvers. Our main result shows that we can solve the $\ell_{q, p}$-norm multicommodity flow problem to a $(1 + \varepsilon)$ approximation in time $O_{q, p}(m^{1+o(1)} k^2 \log(1 / \varepsilon))$, where $k$ is the number of commodities, and $O_{q, p}(\cdot)$ hides constants depending only on $q$ or $p$. As $q$ and $p$ approach to $1$ and infinity respectively, $\ell_{q, p}$-norm flow tends to maximum concurrent flow. We introduce the first iterative refinement framework for $\ell_{q, p}$-norm minimization problems, which reduces the problem to solving a series of decomposable residual problems. In the case of $k$-commodity flow, each residual problem can be decomposed into $k$ single commodity convex flow problems, each of which can be solved in almost-linear time. As many classical variants of multicommodity flows were shown to be complete for linear programs in the high-accuracy regime [Ding-Kyng-Zhang, ICALP'22], our result provides new directions for studying more efficient high-accuracy multicommodity flow algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。