Who's the weakest link?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2827, Issue , 2003, Pages 108-116

  Devanur, Nikhil ^a   Lipton, Richard J ^a   Vishnoi, Nisheeth ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation; Massive networks; Random sampling; Shortest Path

Indexed keywords

ALGORITHMS; GRAPH THEORY; STOCHASTIC SYSTEMS;

ALL-PAIR SHORTEST PATH; APPROXIMATION; DETERMINISTIC ALGORITHMS; FOLLOWING PROBLEM; MASSIVE NETWORKS; PRACTICAL SOLUTIONS; RANDOM SAMPLING; SHORTEST PATH;

TELEPHONE CIRCUITS;

EID: 33747189975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39816-5_10     Document Type: Article

References (18)

1. N. Alon, J. Spencer, The Probabilistic Method, Wiley Interscience, 2000.
2. G. Blom, L Holst, D Sandell, Problems and Snapshots from the World of Probability, Springer-Verlag, 1994.
3. B. Bollobas, Random Graphs, Cambridge University Press, 2001.
4. E.W. Dijkstra, A note on two problems in connection with graphs, Numerische Mathematik, 1, (1976),83-89.
5. M. Dyer, A. Frieze, R. Kannan, A random polynomial algorithm for approximating the volume of convex bodies, Journal of the ACM, (1991), 1-17.
6. P. Erdös, A. Rényi, On the evolution of random graph, Publ. Math. Inst. Hung. Acad. Sci., 5, (1960), 17-61.
7. R.W. Floyd, Algorithm 97: Shortest Path, Communications of the ACM, 5, (1962), 345.
8. D.B. Johnson, Efficient algorithms for shortest paths in sparse networks, Journal of the ACM, 24, (1977), 1-13.
9. N.L. Johnson, S. Kotz, Urn Models and Their Applications, John Wiley, New York, 1977.
10. D.R. Karger, Better Random Sampling Algorithms for Flows in Undirected Graphs. Proc. SODA 1998.
11. D.R. Karger, M.S. Levine, Random sampling in residual graphs, Proc. ACM STOC, 2002.
12. R.M. Karp, M. Luby, Monte Carlo algorithms for the planar multi-terminal network reliability problem. Journal of Complexity, 1, (1985), 45-64.
13. R.M. Karp, M. Luby, N. Madras, Monte Carlo approximation algorithms for enumeration problems, Journal of Algorithms, 10, (1989), 429-448.
14. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
15. K. Mulmuley, Computational Geometry, An Introduction Through Randomized Algorithms, Prentice Hall, 1994.
16. Telecordia. Private Communication, 2002.
17. V.V. Vazirani, Approximation Algorithms, Springer Verlag, 2001.
18. S. Warshall, A theorem on Boolean matrices, Journal of the ACM, 9, (1962), 11-21.