Abstract
In this paper we study a capacitated version of the classical max-k-cut problem. Given a graph we are to partition the vertices into k equal-sized sets such that the number of edges across the sets is maximized. We present a deterministic approximation algorithm for this problem with performance ratio (k – 1) / k. Our algorithm is based on local search, a technique that has been applied to a variety of combinatorial optimization problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Avriel, M., Penn, M., Shpirer, N.: Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discrete Appl. Math. 103(1-3), 271–279 (2000)
Avriel, M., Penn, M., Shpirer, N., Witteboon, S.: Stowage planning for container ships to reduce the number of shifts. Annals of Operations Research 76, 55–71 (1998)
Frieze, A., Jerrum, M.: Improved approximation algorithms for max k-cut and max bisection. Algorithmica 18(1), 67–81 (1997)
Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42(6), 1115–1145 (1995)
Goemans, M., Williamson, D.: Approximation algorithms for max-3-cut and other problems via complex semidefinite programming. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 443–452. ACM Press, New York (2001)
Mahajan, S., Ramesh, H.: Derandomizing approximation algorithms based on semidefinite programming. SIAM Journal on Computing 5, 1641–1663 (1999)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)
Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM 23, 555–565 (1976)
Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaur, D.R., Krishnamurti, R. (2005). The Capacitated max-k-cut Problem. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_71
Download citation
DOI: https://doi.org/10.1007/11424925_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25863-6
Online ISBN: 978-3-540-32309-9
eBook Packages: Computer ScienceComputer Science (R0)