Approximation Algorithms for the Maximum Concurrent Flow Problem (Q4019972)
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: Approximation Algorithms for the Maximum Concurrent Flow Problem |
scientific article; zbMATH DE number 94158
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms for the Maximum Concurrent Flow Problem |
scientific article; zbMATH DE number 94158 |
Statements
Approximation Algorithms for the Maximum Concurrent Flow Problem (English)
0 references
16 January 1993
0 references
maximum concurrent flow problem
0 references
multicommodity flows
0 references
fully polynomial \(\varepsilon\)-approximate algorithm
0 references
linear size reduction
0 references
0.95887214
0 references
0.94374484
0 references
0.92028695
0 references
0 references
0.9198072
0 references
0.91615474
0 references
0.9119902
0 references
0.9119853
0 references
