Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION

Algorithmica (New York)

Volumn 18, Issue 1, 1997, Pages 67-81

  Frieze, A ^a   Jerrum, M ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Approximation algorithms; Combinatorial optimization; Graph connectivity; Randomized algorithms; Semidefinite programming

Indexed keywords

EID: 0346613559     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02523688     Document Type: Article

References (16)

1. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimisation. SIAM Journal on Optimization 5 (1995), 13-51.
2. S. Arora, D. Karger, and M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problem, Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 1995, pp. 284-293.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, New York, 1992, pp. 14-23.
4. 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), 57-61.
5. H. A. David, Order Statistics, Wiley, New York, 1980.
6. W. F. de la Vega, MAXCUT has a randomized approximation scheme in dense graphs, Random Structures and Algorithms 8 (1996), 187-198.
7. J. Galambos, The Asymptotic Theory of Extreme Order Statistics, Wiley, New York, 1978.
8. M. X. Goemans and D. P. Williamson, .878-Approximation algorithms for MAX CUT and MAX 2SAT, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, ACM Press, 1994, New York, pp. 422-431.
9. V. Kann, S. Khanna, J. Lagergren, and A. Panconesi, On the hardness of approximating MAX k-CUT and its dual, Technical Report TRITA-NA-9505, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, 1995.
10. D. Karger, R. Motwani, and M. Sudan, Approximate graph coloring by semidefinite programming, Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, New York, 1994, pp. 2-13.
11. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, Journal of Computer and System Sciences 43 (1991), 425-440.
12. G. Sansone, Orthogonal Functions (translated from the Italian by A. H. Diamond), Interscience, New York, 1959.
13. E. C. Titchmarsh, The Theory of Functions (second edition), Oxford University Press, Oxford, 1939.
14. G. N. Watson, Notes on generating functions of polynomials: Hermite polynomials, Journal of the London Mathematical Society 8 (1933), 194-199.
15. D. J. A. Welsh, Complexity: Knots, Colourings and Counting, London Mathematical Society Lecture Notes, volume 186, Cambridge University Press, Cambridge, 1993.
16. L. A. Wolsey, Heuristic analysis, linear programming and branch and bound, in Combinatorial Optimization II, Mathematical Programming Study, volume 13, North-Holland, Amsterdam, 1980, pp. 121-134.