Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10107-010-0366-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10107-010-0366-6 / rank | |||
Normal rank | |||
Latest revision as of 12:41, 19 December 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
0 references
0 references
0 references
