Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 07:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation |
scientific article |
Statements
Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (English)
0 references
16 September 2010
0 references
