Minimum-Cost Single-Source 2-Splittable Flow (Q3439153)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5157993
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum-Cost Single-Source 2-Splittable Flow |
scientific article; zbMATH DE number 5157993 |
Statements
Minimum-Cost Single-Source 2-Splittable Flow (English)
0 references
29 May 2007
0 references
approximation algorithms
0 references
unsplittable flow
0 references
maximum flow
0 references
0 references
0.9874892830848694
0 references
0.8881832361221313
0 references
0.8881832361221313
0 references
0.8871630430221558
0 references
0.8516397476196289
0 references
