Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (Q2817640)
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: Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks |
scientific article; zbMATH DE number 6621820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks |
scientific article; zbMATH DE number 6621820 |
Statements
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (English)
0 references
1 September 2016
0 references
0.8078367710113525
0 references
0.8076238632202148
0 references
0.804872989654541
0 references
0.80424964427948
0 references
0.7979725003242493
0 references
