Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming (1995)

by M. X. Goemans , D.P. Williamson
Venue:Journal of the ACM
Citations:773 - 14 self

Documents Related by Co-Citation

422 Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization – Farid Alizadeh - 1993
506 Optimization, approximation and complexity classes – C H Papadimitriou, M Yannakakis - 1991
154 Approximate graph coloring by semidefinite programming – David Karger, Rajeev Motwani, Madhu Sudan - 1994
8882 Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H – M R Garey, D S Johnson - 1979
125 Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT – Uriel Feige, Michel Goemans - 1995
969 Geometric Algorithms and Combinatorial Optimization – M Grötschel, L Lovász, A Schrijver - 1993
319 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
125 Interactive proofs and the hardness of approximating cliques – Uriel Feige, Shafi Goldwasser, Laszlo Lovasz, Shmuel Safra, Mario Szegedy - 1996
110 Improved Non-Approximability Results – Mihir Bellare, Madhu Sudan - 1994
152 Zero Knowledge and the Chromatic Number – Uriel Feige, Joe Kilian - 1996
335 On the hardness of approximating minimization problems – C Lund, M Yannakakis - 1994
376 The geometry of graphs and some of its algorithmic applications – Nathan Linial, Eran London, Yuri Rabinovich - 1995
143 Self-scaled barriers and interior-point methods for convex programming – Y E Nesterov, M J Todd - 1997
143 Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION – Alan Frieze, For Max, Mark Jerrum - 1994
37 On the optimality of the random hyperplane rounding technique for MAX CUT – Uriel Feige, Gideon Schechtman - 2000
3204 Matrix Analysis – R Horn, C Johnson - 1985
37 Randomized graph products, chromatic numbers, and the Lovász theta-function – Uriel Feige - 1996
191 Free Bits, PCPs and Non-Approximability -- Towards Tight Results – Mihir Bellare, Oded Goldreich, Madhu Sudan - 1996
561 Some optimal inapproximability results – Johan Håstad - 2002