A new approach to the minimum cut problem

Journal of the ACM

Volumn 43, Issue 4, 1996, Pages 601-640

  Karger, David R ^a,c   Stein, Clifford ^b,d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b DARTMOUTH COLLEGE   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d Dartmouth College   (United States)

Author keywords

Algorithms; Graph algorithm; Minimum cut; Network reliability; Parallel computing; Randomized algorithm

Indexed keywords

COMPUTER NETWORKS; DATA STRUCTURES; GRAPH THEORY; MICROCOMPUTERS; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; RELIABILITY;

GRAPH ALGORITHM; MINIMUM CUT PROBLEM; NETWORK RELIABILITY; RANDOMIZED ALGORITHM;

ALGORITHMS;

EID: 0030197678     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/234533.234534     Document Type: Article

References (69)

1. APPELGATE, D., BIXBY, R., CHVÁATAL, V., AND COOK, W. 1995. Finding cuts in the tsp. Tech. Rep. 95-05. DIMACS, Rutgers Univ., New Brunswick, NJ.
2. 3) time. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 658-667.
3. 2) time. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 47-55.
4. BOLLOBÁS, B. 1986. Extremal graph theory with emphasis on probabilistic methods. Number 62 in Regional Conference Series in Mathematics. American Mathematical Society, Providence, R.I.
5. BOTAFOGO, R. A. 1993. Cluster analysis for hypertext systems. In Proceedings of the 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (Pittsburgh, Pa., June 27-July 1). ACM, New York, pp. 116-125.
6. CHATERJEE, S., GILBERT, J. R., SCHREIBER, R., AND SHEFFLER, T. J. 1996. Array distribution in parallel programs. In Languages and Compilers for Parallel Computing. Lecture Notes in Computer Science Series, vol. 869. Springer-Verlag, New York, pp. 76-91.
7. CHERIYAN, J., AND HAGERUP, T. 1995. A randomized maximum-flow algorithm. SIAM J. Comput. 24, 2 (Apr.), 203-226.
8. CHERNOFF, H. 1952. A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493-509.
9. COLBOURN, C. J. 1987. The Combinatorics of Network Reliability, vol. 4 of The International Series of Monographs on Computer Science. Oxford University Press.
10. COOK, S., DWORK, C., AND REISCHUK, R. 1986. Upper and lower bounds for parallel random access machines without simultaneous writes. SIAM J. Comput. 15, 1 (Feb.), 87-97.
11. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press, Cambridge, Mass.
12. DAHLHAUS, E., JOHNSON, D. S., PAPADIMITRIOU, C. H., SEYMOUR, P. D., AND YANNAKAKIS, M. 1994. The complexity of multiway cuts. SIAM J. Comput. 23, 4, 864-894.
13. DANTZIG, G. B., FULKERSON, D. R., AND JOHNSON, S. M. 1954. Solution of a large-scale traveling salesman problem. Op. Res. 2, 393-410.
14. DINITZ, E. A., KARZANOV, A. V., AND LOMONOSOV, M. V. 1976. On the structure of a family of minimum weighted cuts in a graph. In Studies in Discrete Optimization, A. A. Fridman, ed. Nauka Publishers.
15. EDMONDS, J., AND KARP, R. M. 1972. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 2 (Apr.), 248-264.
16. ELIAS, P., FEINSTEIN, A., AND SHANNON, C. E. 1956. Note on maximum flow through a network. IRE Trans. Inf. Theory IT-2, 117-199.
17. FORD, JR., L. R., AND FULKERSON, D. R. 1956. Maximal flow through a network. Can. J. Math. 8, 399-404, 1956.
18. FORD, JR., L. R., AND FULKERSON, D. R. 1962. Flows in Networks. Princeton University Press, Princeton, N.J.
19. FRANK, A. 1994. On the edge-connectivity algorithm of Nagamochi and Ibaraki. Labarotoire Artemis, IMAG, Université J. Fourier, Grenoble, Switzerland.
20. GABOW, H. N. 1991. Applications of a poset representation to edge connectivity and graph rigidity. In Proceedings of the 32nd Annual Symposium on the Foundations of Computer Science, IEEE Computer Society Press, pp. 812-821.
21. GABOW, H. N. 1995. A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci. 50, 2 (Apr.), 259-273.
22. GALIL, Z., AND PAN, V. 1988. Improved processor bounds for combinatorial problems in ℛscript N signscript c sign. Combinatorica 8, 189-200.
23. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, Calif.
24. GOLDBERG, A. V., AND TARJAN, R. E. 1988. A new approach to the maximum-flow problem. J. ACM 35, 921-940.
25. GOLDSCHLAGER, L. M., SHAW, R. A., AND STAPLES, J. 1982. The maximum flow problem is logspace complete for P. Theoret. Comput. Sci. 21, 105-111.
26. GOLDSCHMIDT, O., AND HOCHBAUM, D. 1988. Polynomial algorithm for the k-cut problem. In Proceedings of the 29th Annual Symposium on the Foundations of Computer Science. IEEE Computer Society Press, pp. 444-451.
27. GOMORY, R. E., AND HU, T. C. 1961. Multi-terminal network flows. J. Soc. Indust. Appl. Math. 9, 4 (Dec.), 551-570.
28. HALPERIN, S., AND ZWICK, U. 1994. An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM. In Proceedings of the 6th Annual ACM-SIAM Symposium on Parallel Algorithms and Architectures. ACM, New York, pp. 1-10.
29. HAO, J., AND ORLIN, J. B. 1994. A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms 17, 3, 424-446.
30. HASTAD, J. 1989. Almost optimal lower bounds for small depth circuits. Adv. Comput. Res. 5, 143-170.
31. KARGER, D. R. 1993. Global min-cuts in ℛscript N signscript c sign and other ramifications of a simple mincut algorithm. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 21-30.
32. KARGER, D. R. 1994a. Random sampling in cut, flow, and network design problems. In Proceedings of the 26th ACM Symposium on Theory of Computing (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 648-657.
33. KARGER, D. R. 1994b. Random sampling in graph optimization problems. Ph.D. dissertation. Stanford Univ., Stanford, Calif. Contact at karger@lcs.mit.edu. Available by ftp from theory.lcs.mit.edu, directory pub/karger.
34. KARGER, D. R. 1994c. Using randomized sparsification to approximate minimum cuts. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 424-432.
35. KARGER, D. R. 1995. A randomized fully polynomial time approximation scheme for the all terminal network reliability problem. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 11-17.
36. KARGER, D. R. 1996. Minimum cuts in near-linear time. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 56-63.
37. KARGER, D. R., AND MOTWANI, R. 1996. Derandomization through approximation: An script N signscript c sign algorithm for minimum cuts. SIAM J. Comput. To appear.
38. 2) algorithm for minimum cuts. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 757-765.
39. KARP, R. M., AND RAMACHANDRAN, V. 1990. Parallel algorithms for shared memory machines. In Handbook of Theoretical Computer Science, vol. A. J. van Leeuwen, ed. MIT Press, Cambridge, Mass. pp. 869-932.
40. KARP, R. M., UPFAL, E., AND WIGDERSON, A. 1986. Constructing a perfect matching is in random script N signscript c sign. Combinatorica 6, 1, 35-48.
41. KARZANOV, A. V., AND TIMOFEEV, E. A. 1986. Efficient algorithm for finding all minimal edge cuts of a non-oriented graph. Cybernetics 22, 156-162.
42. KHULLER, S., AND SCHIEBER, B. 1991. Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs. SIAM J. Comput. 20, 2, 352-375.
43. KING, V., RAO, S., AND TARJAN, R. E. 1994. A faster deterministic maximum flow algorithm. J. Algorithms 17, 3 (Nov.), 447-474.
44. KLEIN, P., PLOTKIN, S. A., STEIN, C., AND TARDOS, E. 1994. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM J. Comput. 23, 3, 466-487.
45. KNUTH, D. E. 1973. Fundamental Algorithms. Vol. 1 of The Art of Computer Programming. Addison-Wesley, Reading, Pa.
46. KNUTH, D. E., AND YAO, A. E. 1976. The complexity of nonuniform random number generation. In Algorithms and Complexity: New Directions and Recent Results, Joseph F. Traub, ed. Academic Press, New York, pp. 357-428.
47. KRUSKAL, JR., J. B. 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. AMS 7, 1, 48-50.
48. LAWLER, E. L., LENSTRA, J. K., RINOOY KAN, A. H. G., AND SHMOYS, D. B., EDS. 1985. The Traveling Salesman Problem. Wiley, New York.
49. LOMONOSOV, M. V. 1994. On Monte Carlo estimates in network reliability. Prob. Eng. Inf. Sci. 8, 245-264.
50. MADER, W. 1968. Homomorphiesätze für graphen. Math. Ann. 178, 154-168.
51. MATULA, D. W. 1986. Determining edge connectivity in O(nm). In Proceedings of the 28th Annual Symposium on the Foundations of Computer Science. IEEE Computer Society Press, pp. 249-251.
52. MATULA, D. W. 1993. A linear time 2 + ε approximation algorithm for edge connectivity. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 500-504.
53. MULMULEY, K. 1994. Computational Geometry. Prentice-Hall, Englewood Cliffs, N.J.
54. MULMULEY, K., VAZIRANI, U. V., AND VAZIRANI, V. V. 1987. Matching is as easy as matrix inversion. Combinatorica 7, 1, 105-113.
55. NAGAMOCHI, H., AND IBARAKI, T. 1992. Computing edge connectivity in multigraphs and capacitated graphs. SIAM J. Disc. Math. 5, 1 (Feb.), 54-66.
56. NAOR, D., AND VAZIRANI, V. V. 1991. Representing and enumerating edge connectivity cuts in ℛscript N signscript c sign. In Proceedings of the 2nd Workshop on Algorithms and Data Structures, F. Dehne, J. R. Sack, and N. Santoro, eds. Lecture Notes in Computer Science, Vol. 519. Springer-Verlag, New York, pp. 273-285.
57. PADBERG, M., AND RINALDI, G. 1990. An efficient algorithm for the minimum capacity cut problem. Math. Prog. 47, 19-39.
58. PHILLIPS, S., AND WESTBROOK, J. 1993. Online load balancing and network flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 402-411.
59. PICARD, J. C., AND QUEYRANNE, M. 1982. Selected applications of minimum cuts in networks. I.N.F.O.R: Can. J. Oper. Res. Inf. Proc. 20, (Nov.), 394-422.
60. PICARD, J. C., AND RATLIFF, H. D. 1975. Minimum cuts and related problems. Networks 5, 357-370.
61. PODDERYUGIN, V. D. 1973, An algorithm for finding the edge connectivity of graphs. Vopr. Kibern. 2, 136.
62. RAMACHANDRAN, V. 1987. Flow value, minimum cuts and maximum flows. Manuscript.
63. RAMANATHAN, A., AND COLBOURN, C. 1987. Counting almost minimum cutsets with reliability applications. Math. Prog. 39, 3 (Dec.), 253-261.
64. SHILOACH, Y., AND VISHKIN, U. 1982. An O(log n) parallel connectivity algorithm. J. Algorithms 3, 57-67.
65. SLEATOR, D. D., AND TARJAN, R. E. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 26, 3 (June), 362-391.
66. STOER, M., AND WAGNER, F. 1994. A simple min cut algorithm. In Proceedings of the 1994 European Symposium on Algorithms, Jan van Leeuwen, ed. Springer-Verlag, New York, pp. 141-147.
67. TARJAN, R. E. 1983. Data structures and network algorithms. In CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44. SIAM, Philadelphia, Pa.
68. VAZIRANI, V. V., AND YANNAKAKIS, M. 1992. Suboptimal cuts: Their enumeration, weight, and number. In Automata, Languages and Programming. 19th International Colloquium Proceedings. Lecture Notes in Computer Science, Vol. 623. Springer-Verlag, New York, pp. 366-377.
69. VON NEUMANN, J. 1951. Various techniques used in connection with random digits. Nat. Bur. Stand. Appl. Math Ser. 12, 36-38.