Abstract
The k-Min-Cut (k-Max-Cut) problem consists of partitioning the vertices of an edge weighted (undirected) graph into k sets so as to minimize (maximize) the sum of the weights of the edges joining vertices in different subsets. We concentrate on the k-Max-Cut and k-Min-Cut problems defined over complete graphs that satisfy the triangle inequality, as well as on d-dimensional graphs. For the one-dimensional version of our partitioning problems, we present efficient algorithms for their solution as well as lower bounds for the time required to find an optimal solution, and for the time required to verify that a solution is an optimal one. We also establish a bound for the objective function value of an optimal solution to the k-Min-Cut and k-Max-Cut problems whose graph satisfies the triangle inequality. The existence of this bound is important because it implies that any feasible solution is a near-optimal approximation to such versions of the k-Max-Cut and k-Min-Cut problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Ben-Or, “Lower Bounds for Algebraic Computation Trees,” Proc. 15th ACM Annual Symposium on Theory of Computing 80–86, 1983.
D. Dobkin, and R. Lipton, “Multidimensional Searching Problems,” SIAM Journal on Computing, 15(2), 181–186, 1976.
M. R. Garey, D. S. Johnson, and L. Stockmeyer, “Some Simplified NP-Complete Graph Problems,” Theoretical Computer Science, (1), 237–267, 1976.
M. R. Garey and D. S. Johnson, “Computers and Intractability,” Freeman, 1980.
A. George and J. W. H. Liu, “An automatic nested dissection algorithm for irregular finite element problems,” SIAM Journal on Numerical Analysis, 15, 1053–1069, 1978.
J. R. Gilbert and E. Zmijewski, “Combinatorial Sparse Matrix Theory,” Chapter 5, Lecture Notes in Computer Science, UCSB, 1991.
T. F. Gonzalez, “Clustering to Minimize the Maximum Intercluster Distance,” Theoretical Computer Science, 38, 293–306, 1985.
E. Horowitz and S. Sahni, “Fundamentals of Computer Algorithms,” Computer Science Press, 1978.
B. W. Kernighan and S. Lin, “An Efficient Heuristic Procedure for Partitioning Graphs,” The Bell System Technical Journal, 49, 291–307, 1970.
B. Krishnamurthy, “An improved min-cut algorithm for partition VLSI networks,” IEEE Transactions on Computers, C(33), 438–446, 1984.
T. Murayama, “Algorithmic Issues for the Min-Cut and Max-Cut Problems,” M.S. Thesis, Department of Computer Science, The University of California, Santa Barbara, December 1991.
D. F. Wong, H. W. Leong, and C. L. Liu, “Simulated Annealing for VLSI Design,” Kluwer Academic Publishers, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gonzalez, T.F., Murayama, T. (1992). Algorithms for a class of Min-Cut and Max-Cut problem. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_62
Download citation
DOI: https://doi.org/10.1007/3-540-56279-6_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56279-5
Online ISBN: 978-3-540-47501-9
eBook Packages: Springer Book Archive