Improved approximation algorithms for MAX k-CUT and MAX BISECTION

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 920, Issue , 1995, Pages 1-13

  Frieze, Alan ^a   Jerrum, Mark ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; GRAPH ALGORITHMS; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

CARDINALITIES; CROSSING EDGES; MAX-BISECTION; NON-TRIVIAL; PERFORMANCE GUARANTEES; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; SEMI-DEFINITE PROGRAMMING RELAXATIONS; WEIGHTED GRAPH;

INTEGER PROGRAMMING;

EID: 84948979382     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59408-6_37     Document Type: Conference Paper

References (11)

1. F. Alizadeh, Interior point methods in Semi-Definite Programming with applications to Combinatorial Optimisation. (To appear.)
2. 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.
3. H. A. David, Order Statistics, Wiley~ New York, 1980.
4. J. Galambos, The Asymptotic Theory of Extreme Order Statistics, Wiley, New York, 1978.
5. 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.
6. 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.
7. G. Sansone, Orthogonal Functions, (translated from the Italian by A. H. Diamond), Interscience Publishers, New York, 1959.
8. E. C. Titchmarsh, The Theory of Functions (second edition), Oxford University Press, 1939.
9. G. N. Watson, Notes on generating functions of polynomials: Hermite polynomials, Journal of the London Mathematical Society 8 (1933), pp. 194-199.
10. D. J. A. Welsh, Complexity: Knots, Colourings and Counting, London Mathematical Society Lecture Notes 186, Cambridge University Press, 1993.
11. L. A. Wolsey, Heuristic analysis, hnear programming and branch and bound, Mathematical Programming Study 13: Combinatorial Optimization II, North-Holland, 1980, pp. 121-134.