Max concurrent flow problem (Q3501698)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Max concurrent flow problem |
scientific article; zbMATH DE number 5284375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Max concurrent flow problem |
scientific article; zbMATH DE number 5284375 |
Statements
3 June 2008
0 references
max concurrent flow problem
0 references
fully polynomial approximation schemes
0 references
complexity of algorithm
0 references
0.8742347359657288
0 references
0.873502254486084
0 references
0.8644511699676514
0 references
0.8246213793754578
0 references
0.8130976557731628
0 references
