Time and Cost Trade-Offs in Gossiping
β Scribed by Czumaj, Artur; Gasieniec, Leszek; Pelc, Andrzej
- Book ID
- 118198968
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1998
- Tongue
- English
- Weight
- 323 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0895-4801
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Tiffs paper discusses a bieriterion approach to sequencing with tlme/cost tnlde-offs, This approach, which produces an efficient frontier of possible schedules, has the fidv'mtage that it does not require tile sequencing criteria to be measurable in the sllnle ilnils as the resource allocation cost,
In this paper we study two problems which have a provable gap between their randomized and deterministic complexity; oblivious routing on fixed connection Ε½ . networks and finding the median on a parallel comparison tree PCT . We prove a trade-off between the amount of randomness used by an algorith