arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.00653cs.DS
收藏

电流和其它p-范流的切割切换和循环切换

Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows

Monika Henzinger, Billy Jin, Richard Peng, David P. Williamson

摘要:

研究了无向图中求流的问题,以使任意$p > 1$的流的加权$p$ -范数最小化。当$p=2$时,问题是找到电流,其对偶等价于求解拉普拉斯线性系统。情况$p = \infty$对应于找到最小拥塞流,其等同于最大流。一个典型的算法建设这样的问题,认为顶点的潜力对应的流量守恒的约束,并有两个简单类型的更新步骤:循环切换,修改沿一个周期的流量,和切割切换,修改所有潜力的一面切割。这两种类型的步骤通常都是相对于生成树$T$执行的;则该循环是$T$的基本循环,并且该切割是$T$的基本切割。在本文中,我们表明,这些简单的步骤可以被用来给一个新的有效的实现$p = 2$的情况下,并找到接近最佳的$p$ -范数流在低的迭代次数为所有值的$p > 1$。与已知的更快的算法相比,这些问题,我们的算法更简单,更组合,也暴露了这些算法和动态图数据结构,以前没有正式的几个潜在的连接。

英文摘要:

We study the problem of finding flows in undirected graphs so as to minimize the weighted $p$-norm of the flow for any $p > 1$. When $p=2$, the problem is that of finding an electrical flow, and its dual is equivalent to solving a Laplacian linear system. The case $p = \infty$ corresponds to finding a min-congestion flow, which is equivalent to max-flows. A typical algorithmic construction for such problems considers vertex potentials corresponding to the flow conservation constraints, and has two simple types of update steps: cycle toggling, which modifies the flow along a cycle, and cut toggling, which modifies all potentials on one side of a cut. Both types of steps are typically performed relative to a spanning tree $T$; then the cycle is a fundamental cycle of $T$, and the cut is a fundamental cut of $T$. In this paper, we show that these simple steps can be used to give a novel efficient implementation for the $p = 2$ case and to find near-optimal $p$-norm flows in a low number of iterations for all values of $p > 1$. Compared to known faster algorithms for these problems, our algorithms are simpler, more combinatorial, and also expose several underlying connections between these algorithms and dynamic graph data structures that have not been formalized previously.

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

↑