Abstract
This paper describes two results on graph partitioning. Our first result is a non-crossing property of minimum 3-cuts. This property generalizes the results by Gomory-Hu on min-cuts (2-cute) in graphs. We also give an algorithm for finding minimum 3-cuts in O(n 3) Max-Flow computations. The second part of the paper describes a Performance Bounding technique based on Cut Trees for solving Partitioning Problems in weighted, undirected graphs. We show how to use this technique to derive approximation algorithms for two problems, the Minimum k-cut problem and the Multi-way cut problem.Our first illustration of the bounding technique is an algorithm for the Minimum k-cut which requires O(kn(m + n log n)) steps and gives an approximation of 2(1-1/k). We then generalise the Bounding Technique to achieve the approximation factor 2 — f(j, k) wheref(j, k) = j/k — (j — 2)/k 2 + O(j/k 3), j ≥ 3. The algorithm presented for the Minimum k-cut problem is polynomial in n and k for fixed j. We also give an approximation algorithm for the planar Multi-way Cut problem.
Part of this work was done while the author was a visitor at the Max-Planck-Institute für Informatik, Saarbrücken, Germany.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
V. Chvátal, “Tough graphs and Hamiltonian circuits”, Discrete Mathematics, Vol. 5, 1973, pp. 215–228.
W. H. Cunningham, “Optimal attack and reinforcement of a. network”, JACM, Vol. 32, No. 3, 1985, pp. 549–561.
Springer-VerlagS. Chopra and M.R. Rao,“On the Multi-way cut Polyhedron”, NET-WORKS(21), 1991, 51–89.
E. Dalhaus, D. S. Johnson, C. H. Papadimitriou, P. Seymour and M. Yannakakis, “The complexity of the multiway cuts”, Proc. 24th Annual ACM Symposium on the Theory of Computing, 1992, pp. 241–251.
R. Gomory and T. C. Hu, “Multi-terminal network flows”, J. SIAM, Vol. 9, 1961, pp. 551–570.
O. Goldschmidt and D. S. Hochbaum, “Polynomial algorithm for the k-cut problem”, Proc. 29th Annual Symp. on the Foundations of Computer Science, 1988, pp. 444–451.
Xin He, “On the planar 3-cut problem”, J. Algorithms, 12, 1991, pp. 23–37.
D. Hochbaum and D. Shmoys, “An O(V 2) algorithm for the planar 3-cut problem,” SIAM J. on Alg. and Discrete Methods, 6:4:707–712, 1985.
H. Saran and V. Vasirani, “Finding k-cuts within twice the optimal,” Proc. 32nd Annual Symp. on Foundation of Computer Science,1991, 743–751.
M. Stoer and F. Wagner, “A Simple Min Cut Algorithm”, Technical Report, Fachberich Mathematik and Informatik, Freie Universitat, Berlin.
H.S. Stone, “Multiprocessor scheduling with the aid of Network flow algorithms” IEEE Trans.on Software Engg., SE-3, 1977, 85–93.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapoor, S. (1996). On minimum 3-cuts and approximating k-cuts using Cut Trees. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds) Integer Programming and Combinatorial Optimization. IPCO 1996. Lecture Notes in Computer Science, vol 1084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61310-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-61310-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61310-7
Online ISBN: 978-3-540-68453-4
eBook Packages: Springer Book Archive