引用thorncorona · 2022-06
“We give 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.”
转引摘要:以 m^(1+o(1)) 时间精确求解最大流和最小费用流