Minimum-cost single-source 2-splittable flow (Q1041715)
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: Minimum-cost single-source 2-splittable flow |
scientific article; zbMATH DE number 5642313
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum-cost single-source 2-splittable flow |
scientific article; zbMATH DE number 5642313 |
Statements
Minimum-cost single-source 2-splittable flow (English)
0 references
4 December 2009
0 references
analysis of algorithms
0 references
approximation algorithms
0 references
graph algorithms
0 references
maximum flow
0 references
unsplittable flow
0 references
0 references
0 references
0.9330008
0 references
0.8968506
0 references
0.8926016
0 references
0.8689752
0 references
0 references
0.8618618
0 references
0.8573799
0 references
