𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximate distributed Bellman-Ford algorithms

✍ Scribed by Awerbuch, B.; Bar-Noy, A.; Gopal, M.

Book ID
117861083
Publisher
IEEE
Year
1994
Tongue
English
Weight
557 KB
Volume
42
Category
Article
ISSN
0090-6778

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A heuristic improvement of the Bellman-F
A heuristic improvement of the Bellman-Ford algorithm
✍ Andrew V. Goldberg; Tomasz Radzik πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 334 KB

We describe a new shortest paths algorithm. Our algorithm achieves the same O(nm) worst-case time bound as Bellman-Ford algorithm but is superior in practice.

Improved Algorithms via Approximations o
Improved Algorithms via Approximations of Probability Distributions
✍ Suresh Chari; Pankaj Rohatgi; Aravind Srinivasan πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 235 KB

We present two techniques for constructing sample spaces that approximate probability distributions. The first is a simple method for constructing the small-bias probability spaces introduced by Naor and Naor. We show how to efficiently combine this construction with the method of conditional probab