Publication | Closed Access

Approximate minimum-cost multicommodity flows in $$\tilde O$$ (ɛ −2 KNM) timetime

Numerical AnalysisNetwork FlowsEngineeringOptimization ProblemComputational ComplexityApproximate Minimum-cost MulticommodityCombinatorial OptimizationDiscrete OptimizationApproximation Theoryɛ −2 Knm\Tilde O