Journal of the ACM · 2025 · 16 citations · 85 references
ComputingComputer ScienceAlgorithmsEdge ComputingOptimizationApproximation AlgorithmsCombinatorial OptimizationGraph AlgorithmsNetwork Flow AlgorithmsNetwork FlowsTime ComplexityConvex FunctionsDirected GraphsDynamic Graph Data StructuresIsotonic RegressionMaximum FlowMaximum Flow AlgorithmsMinimum Cost FlowOptimal Transport
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 \(m^{o(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 edge-separable 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.
85
A new polynomial-time algorithm for linear programming
Narendra Karmarkar · COMBINATORICA · 1984 · 4.8K citations
Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text