Single-source \(k\)-splittable min-cost flows (Q1015297)
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: Single-source \(k\)-splittable min-cost flows |
scientific article; zbMATH DE number 5552062
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-source \(k\)-splittable min-cost flows |
scientific article; zbMATH DE number 5552062 |
Statements
Single-source \(k\)-splittable min-cost flows (English)
0 references
7 May 2009
0 references
approximation algorithm
0 references
multi-commodity flow
0 references
network flow
0 references
routing
0 references
unsplittable flow
0 references
\(k\)-splittable flow
0 references
0 references
0.9356483
0 references
0.9330008
0 references
0.9330008
0 references
0 references
0.90480554
0 references
0.8913882
0 references
0 references
0.8774423
0 references
