Randomized fully polynomial time approximation scheme for the all-terminal network reliability problem

SIAM Journal on Computing

Volumn 29, Issue 2, 1999, Pages 492-514

  Karger, David R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FAILURE ANALYSIS; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS;

FULLY POLYNOMIAL RANDOMIZED APPROXIMATION SCHEMES; TUTTE POLYNOMIAL;

RELIABILITY THEORY;

EID: 0033298274     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796298340     Document Type: Article

References (26)

1. N. ALON, A. FRIEZE, AND D. WELSH, Polynomial time randomized approximation schemes for the Tutte polynomial of dense graphs, in Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, S. Goldwasser, ed., IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 24-35.
2. 2) time, in Proceedings of the 28th ACM Symposium on Theory of Computing, G. Miller, ed., ACM Press, 1996, pp. 47-55.
3. C. C. CHEKURI, A. V. GOLDBERG, D. R. KARGER, M. S. LEVINE, AND C. STEIN, Experimental study of minimum cut algorithms, in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, M. Saks, ed., ACM-SIAM, New Orleans, LA, 1997, pp. 324-333.
4. C. J. COLBOURN, The combinatorics of network reliability, The International Series of Monographs on Computer Science. Vol. 4, Oxford University Press, New York, 1987.
5. E. A. DINITZ, A. V. KARZANOV, AND M. V. LOMONOSOV, On the structure of a family of minimum weighted cuts in a graph, in Studies in Discrete Optimization, A. A. Fridman, ed., Nauka Publishers, Moscow, 1976, pp. 290-306.
6. M. E. DYER, A. M. FRIEZE, AND R. KANNAN, A random polynomial time algorithm for approximating the volume of convex bodies, J. ACM, 38 (1991.), pp. 1-17.
7. M. JERRUM AND A. SINCLAIR, Approximating the permanent, SIAM J. Comput., 18 (1989), pp. 1149-1178.
8. R. KANNAN, Markov chains and polynomial time algorithms, in Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, S. Goldwasser, ed., IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 656-671.
9. D. R. KARGER, Random Sampling in Graph Optimization Problems, Ph.D. thesis, Stanford University, Stanford, CA, 1994.
10. D. R. KARGER, A randomized fully polynomial approximation scheme for the all terminal network reliability problem, in Proceedings of the 27th ACM Symposium on Theory of Computing, ACM Press. New York, 1995. pp. 11-17.
11. D. R. KARGER, Minimum cuts in near-linear time, in Proceedings of the 28th ACM Symposium on Theory of Computing, G. Miller, ed., ACM Press, New York, 1996, pp. 56-63.
12. D. R. KARGER, Random sampling in cut, flow, and network design problems, Math. Oper. Res., 24 (1999), pp. 383-413.
13. D. R. KARGER AND R. MOTWANI, Derandomization through approximation: An NC algorithm for minimum cuts, SIAM J. Comput., 26 (1997), pp. 255-272.
14. 2) algorithm for minimum cuts, in Proceedings of the 25th ACM Symposium on Theory of Computing, A. Aggarwal, ed., ACM Press, New York, 1993, pp. 757-765.
15. D. R. KARGER AND C. STEIN, A new approach to the minimum cut problem, J. ACM, 43 (1996), pp. 601-640.
16. D. R. KARGER AND R. P. TAI, Implementing a fully polynomial time approximation scheme for all terminal network reliability, in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, M. Saks, ed., ACM-SIAM, New Orleans, LA, Jan. 1997, pp. 334-343.
17. R. M. KARP, M. LUBY, AND N. MADRAS, Monte Carlo approximation algorithms for enumeration problems, J. Algorithms, 10 (1989), pp. 429-448.
18. R. M. KARP AND M. G. LUBY, Monte Carlo algorithms for planar multiterminal network reliability problems, J. Complexity, 1 (1985), pp. 45-64.
19. D. E. KNUTH, Fundamental algorithms, The Art of Computer Programming, 2nd ed., Addison-Wesley Publishing Company, Vol. 1, Reading, MA, 1973.
20. M. V. LOMONOSOV, Bernoulli scheme with closure, Problems Inform. Transmission, 10 (1974), pp. 73-81.
21. M. V. LOMONOSOV, On Monte Carlo estimates in network reliability, Probab. Engrg. Inform. Sci., 8 (1994), pp. 245-264.
22. M. V. LOMONOSOV AND V. P. POLESSKII, Lower bound of network reliability, Problems Inform. Transmission, 7 (1971), pp. 118-123.
23. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, New York, 1995.
24. J. S. PROVAN AND M. O. BALL. The complexity of counting cuts and of computing the probability that a network remains connected, SIAM J. Comput., 12 (1983), pp. 777-788.
25. L. VALIANT, The complexity of enumeration and reliability problems, SIAM J. Comput., 8 (1979), pp. 410-421.
26. V. V. VAZIRANI AND M. YANNAKAKIS, Suboptimal cuts: Their enumeration, weight, and number, in Automata, Languages and Programming, 19th International Colloquium Proceedings, Lecture Notes in Comput. Sci. 623, Springer-Verlag, New York, Berlin, 1992, pp. 366-377.