.png){kind=icon}
返回
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow
.png){kind=icon}
PRE
AI
DOI：10.1145/3610940.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m(1+o(1)) time. Our algorithm builds the flow through a sequence of m(1+o(1)) approximate undirected minimum-ratio cycles, each of which is computed and processed in amortized mo(1) time using a new dynamic graph data structure. Our framework extends to algorithms running in m(1+o(1)) time for computing flows that minimize general edgeseparable convex functions to high accuracy. This gives almost-linear time algorithms for several problems including entropy-regularized optimal transport, matrix scaling, p-norm flows, and p-norm isotonic regression on arbitrary directed acyclic graphs.
期刊
IF:
12.2
论文数:
1.2W
被引数:
3.7W
机构
引用论文
Preparation of Catalyst for Hydrogen Production Reaction of Sodium Borohydride and Its Effectiveness
OAAI
OAAI分享收藏A Leakage Model of Contact Mechanical Seals Based on the Fractal Theory of Porous Medium.png)
Coatings
OAAI
CoatingsIF0
OAAI分享收藏CBAM VGG16: An efficient driver distraction classification using CBAM embedded VGG16 architecture
PREAI
分享收藏分享收藏
查看更多内容