Approximating the single source unsplittable min-cost flow problem (Q1849529)
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: Approximating the single source unsplittable min-cost flow problem |
scientific article; zbMATH DE number 1837145
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the single source unsplittable min-cost flow problem |
scientific article; zbMATH DE number 1837145 |
Statements
Approximating the single source unsplittable min-cost flow problem (English)
0 references
1 December 2002
0 references
approximation algorithm
0 references
multi-commodity flow
0 references
network flow
0 references
routing
0 references
unsplittable flow
0 references
