Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms (Q2464381)
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 5221898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms |
scientific article; zbMATH DE number 5221898 |
Statements
Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms (English)
0 references
20 December 2007
0 references
0.9972625970840454
0 references
0.8563182353973389
0 references
0.8513163328170776
0 references
