Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376)
From MaRDI portal
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
0 references
0 references
0 references
