Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558)
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: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms |
scientific article; zbMATH DE number 2131049
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms |
scientific article; zbMATH DE number 2131049 |
Statements
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (English)
0 references
25 January 2005
0 references
0.9497195
0 references
0.92607963
0 references
0.92566335
0 references
0.9144049
0 references
0.9122699
0 references
0 references
0.90563816
0 references
0 references
0.9030855
0 references
