Abstract
We present polynomial time randomized approximation algorithms with non trivial performance guarantees for the problem of partitioning the vertices of a weighted graph into two sets of sizes that differ at most by a given threshold B, so as to maximize the weight of the crossing edges. For B equal to 0 this problem is known as Max Bisection, whereas for B equal to the number n of nodes it is the Maximum Cut problem. The approximation results are obtained by extending the methodology used by Y. Ye for Max Bisection and by combining this technique with another one that uses the algorithm of Goemans and Williamson for the Maximum Cut problem. When B is equal to zero the approximation ratio achieved coincides with the one obtained by Y. Ye; otherwise it is always above this value and tends to the value obtained by Goemans and Williamson as B approaches the number n of nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ageev, A.A., Sviridenko, M.I.: Approximation algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 17–30. Springer, Heidelberg (1999)
Akiyama, J., Avis, D., Chvatal, V., Era, H.: Balancing signed graphs. Discrete Applied Mathematics 3, 227–233 (1981)
Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optimization 5, 13–51 (1995)
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45, 501–555 (1998)
Feige, U., Langberg, M.: Approximation algorithms for maximization problems in graph partitioning. J. of Algorithms 41, 1074–1211 (2001)
Frieze, A., Jerrum, M.: Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18, 67–81 (1997)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of ACM 42, 1115–1145 (1995)
Hayrapetyan, A., Kempe, D., Pal, M., Svitkina, Z.: Unbalanced Graph Cuts. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 191–202. Springer, Heidelberg (2005)
Håstad, J.: Some optimal inapproximability results. Journal of the ACM 48, 798–869 (2001)
Kaporis, A.C., Kirousis, L.M., Stavropoulos, E.C.: Approximating Almost All Instances of MAX-CUT Within a Ratio Above the Håstad Threshold. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 432–443. Springer, Heidelberg (2006)
Poljak, S., Tuza, Z.: Maximum cuts and large bipartite subgraphs. In: Cook, W., Lovasz, L., Seymour, P. (eds.) Combinatorial Optimization. AMS - DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 20, pp. 181–244. American Mathematical Society, Providence (1995)
Trevisan, L., Sorkin, G., Sudan, M., Williamson, D.: Gadgets, approximation, and linear programming. SIAM Journal on Computing 29(6), 2074–2097 (2000)
Vazirani, V.V.: Approximation Algorithms, ch. 26. Springer, Heidelberg (2001)
Ye, Y.: A.699-approximation algorithm for Max-Bisection. Math. Programming Ser. A 90, 101–111 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galbiati, G., Maffioli, F. (2007). Approximating Maximum Cut with Limited Unbalance. In: Erlebach, T., Kaklamanis, C. (eds) Approximation and Online Algorithms. WAOA 2006. Lecture Notes in Computer Science, vol 4368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11970125_16
Download citation
DOI: https://doi.org/10.1007/11970125_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69513-4
Online ISBN: 978-3-540-69514-1
eBook Packages: Computer ScienceComputer Science (R0)