By rounding tiny multiplicative weights to zero, the authors localize Sherman's flow algorithm and obtain a (1+epsilon)-approximate k-commodity flow algorithm on expanders in (m + epsilon^{-3}k^3D) n^{o(1)} time.
Algorithm for solution of a problem of maximum flow in networks with power estimation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Local Sherman's Algorithm for Multi-commodity Flow
By rounding tiny multiplicative weights to zero, the authors localize Sherman's flow algorithm and obtain a (1+epsilon)-approximate k-commodity flow algorithm on expanders in (m + epsilon^{-3}k^3D) n^{o(1)} time.