Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56030327, #quickstatements; #temporary_batch_1706298923732 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/331524.331526 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150148016 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:03, 19 March 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
