Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56030327, #quickstatements; #temporary_batch_1706298923732 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56030327 / rank | |||
Normal rank | |||
Revision as of 22:03, 26 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms |
scientific article |
Statements
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (English)
0 references
25 January 2005
0 references
