Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximate minimum-cost multicommodity flows in O(^-2KNM) time |
scientific article; zbMATH DE number 1046466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time |
scientific article; zbMATH DE number 1046466 |
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
0 references
0.8993663
0 references
0 references
0.89231867
0 references
0.8917063
0 references
0.89005864
0 references
