Meet and merge: approximation algorithms for confluent flows (Q2495396)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5037290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Meet and merge: approximation algorithms for confluent flows |
scientific article; zbMATH DE number 5037290 |
Statements
Meet and merge: approximation algorithms for confluent flows (English)
0 references
30 June 2006
0 references
confluent flow
0 references
network flow
0 references
routing
0 references
approximation algorithms
0 references
randomization
0 references
rounding
0 references
multi-commodity flow
0 references
0 references
0 references
0 references
0 references
0.99999994
0 references
0.8673956
0 references
0.8619505
0 references
0 references
0.8578088
0 references
0.85066235
0 references
0.84650123
0 references
0 references
