Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time |
scientific article |
Statements
Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (English)
0 references
11 November 1997
0 references
block-angular program
0 references
budget-constrained network flow
0 references
structured optimization
0 references
\(\varepsilon\)-approximate solution
0 references
cost-constrained \(K\)-commodity flow problem
0 references
approximate minimum-cost multicommodity flow
0 references
