Abstract
Polynomial-time approximation algorithms with non-trivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise the weight of crossing edges, and (b) partitioning the vertices of a weighted graph into two blocks of equal cardinality, again so as to maximise the weight of crossing edges. The approach, pioneered by Goemans and Williamson, is via a semidefinite programming relaxation.
The first author is supported by NSF grant CCR-9225008. The work described here was undertaken while the second author was visiting Carnegie Mellon University; at that time, he was a Nuffield Science Research Fellow, and was supported in part by grant GR/F 90363 of the UK Science and Engineering Research Council, and Esprit Working Group 7097 “RAND.”
Preview
Unable to display preview. Download preview PDF.
References
F. Alizadeh, Interior point methods in Semi-Definite Programming with applications to Combinatorial Optimisation. (To appear.)
E. Bofinger and V. J. Bofinger, The correlation of maxima in samples drawn from a bivariate normal distribution, The Australian Journal of Statistics 7 (1965), pp. 57–61.
H. A. David, Order Statistics, Wiley, New York, 1980.
J. Galambos, The Asymptotic Theory of Extreme Order Statistics, Wiley, New York, 1978.
M. X. Goemans and D. P. Williamson, 878-Approximation algorithms for MAXCUT and MAX 2SAT, Proceedings of the 26th Annual ACM Symposium on Theory of Computing (1994) pp. 422–431.
D. Karger, R. Motwani, and M. Sudan, Approximate graph coloring by semidefinite programming, Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, Computer Society Press, 1994, pp. 2–13.
G. Sansone, Orthogonal Functions, (translated from the Italian by A. H. Diamond), Interscience Publishers, New York, 1959.
E. C. Titchmarsh, The Theory of Functions (second edition), Oxford University Press, 1939.
G. N. Watson, Notes on generating functions of polynomials: Hermite polynomials, Journal of the London Mathematical Society 8 (1933), pp. 194–199.
D. J. A. Welsh, Complexity: Knots, Colourings and Counting, London Mathematical Society Lecture Notes 186, Cambridge University Press, 1993.
L. A. Wolsey, Heuristic analysis, linear programming and branch and bound, Mathematical Programming Study 13: Combinatorial Optimization II, North-Holland, 1980, pp. 121–134.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frieze, A., Jerrum, M. (1995). Improved approximation algorithms for MAX k-CUT and MAX BISECTION. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_37
Download citation
DOI: https://doi.org/10.1007/3-540-59408-6_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59408-6
Online ISBN: 978-3-540-49245-0
eBook Packages: Springer Book Archive