Why locally-fair maximal flows in client-server networks perform well (Q652641)
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 5988545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Why locally-fair maximal flows in client-server networks perform well |
scientific article; zbMATH DE number 5988545 |
Statements
Why locally-fair maximal flows in client-server networks perform well (English)
0 references
15 December 2011
0 references
distributed flow algorithms
0 references
oblivious routing
0 references
network algorithms
0 references
maximal flow
0 references
0.9987082481384276
0 references
0.760779619216919
0 references
0.760779619216919
0 references
0.7456439137458801
0 references
0.7427353262901306
0 references
