arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.03260cs.DSmath.OC
收藏

一种求解几乎$\widetilde{O}(m^{4/3})$时间最大流的势降启发算法

A Potential Reduction Inspired Algorithm for Exact Max Flow in Almost $\widetilde{O}(m^{4/3})$ Time

Tarun Kathuria

摘要:

本文给出了一个计算有向图在$\widetilde{O}(m^{4/3+o(1)}U^{1/3})$时间内的$s$-$t$最大流的算法.我们的算法的灵感来自潜在的减少内点方法的线性规划。代替使用势函数的缩放梯度/牛顿步骤,我们采取使势值的减小最大化的步骤,该步骤在中心路径上前进一定量,这可以有效地计算。这使我们能够跟踪中心路径,我们的进展只依赖于拥塞向量上的$\ell_\infty$范数边界(与以前的作品所需的$\ell_4$范数相反),并在$O(\sqrt{m})$迭代中运行。为了通过在$\ell_\infty$范数上建立更严格的界限来提高迭代次数,我们考虑Madry \cite{M13,M16,CMSV17}和Liu-Sidford \cite{LS20}的加权中心路径框架。我们考虑的不是改变权重来最大化能量,而是找到使潜在价值的最大减少最大化的权重。最后,类似于在\cite{LS20}中找到最大化能量的权重,这个问题可以通过用于平滑$\ell_2$范数流问题的迭代细化框架来解决,\cite{KPSW19}完成我们的算法。我们相信,我们的潜在减少为基础的观点提供了一个通用的框架,这可能会导致更快的算法最大流量。

英文摘要:

We present an algorithm for computing $s$-$t$ maximum flows in directed graphs in $\widetilde{O}(m^{4/3+o(1)}U^{1/3})$ time. Our algorithm is inspired by potential reduction interior point methods for linear programming. Instead of using scaled gradient/Newton steps of a potential function, we take the step which maximizes the decrease in the potential value subject to advancing a certain amount on the central path, which can be efficiently computed. This allows us to trace the central path with our progress depending only $\ell_\infty$ norm bounds on the congestion vector (as opposed to the $\ell_4$ norm required by previous works) and runs in $O(\sqrt{m})$ iterations. To improve the number of iterations by establishing tighter bounds on the $\ell_\infty$ norm, we then consider the weighted central path framework of Madry \cite{M13,M16,CMSV17} and Liu-Sidford \cite{LS20}. Instead of changing weights to maximize energy, we consider finding weights which maximize the maximum decrease in potential value. Finally, similar to finding weights which maximize energy as done in \cite{LS20} this problem can be solved by the iterative refinement framework for smoothed $\ell_2$-$\ell_p$ norm flow problems \cite{KPSW19} completing our algorithm. We believe our potential reduction based viewpoint provides a versatile framework which may lead to faster algorithms for max flow.

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

↑