International Workshop RANDOMa#39;97, Bologna, Italy, July 11-12, 1997 Proceedings Jose Rolim ... By (10) and (11), Ac(i, j) ; nj alt; (L, + and it follows from ( 3) that edge (i, j) is an element of the set on the right-hand side with probability p ... Since the worst-case running time of the Bellman-Ford algorithm on (Dn, c) is O (n3), we can easily afford to run the Bellman-Ford algorithm on (Apagt;n, C) in ... The single-source shortest-path problem can then be solved in time O(n2} with high probability.
|Title||:||Randomization and Approximation Techniques in Computer Science|
|Publisher||:||Springer Science & Business Media -|