M. Goemans, D.P. Williamson, "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming," Journal of the ACM, 42(1995), pp. 1115--1145. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Two Algorithms for Nearest-Neighbor Search in High Dimensions - Kleinberg (1997) (91 citations) (Correct)
No context found.
M. Goemans, D.P. Williamson, "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming," Journal of the ACM, 42(1995), pp. 1115--1145.
Geometry of Semide - Nite Max-Cut Relaxations (Correct)
No context found.
M.X. GOEMANS and D.P. WILLIAMSON. Improved approximation algorithms for maximum cut and satis ability problems using semide nite programming. J. Assoc. Comput. Mach., 42(6):1115-1145, 1995. 34
Consequences and Limits of Nonlocal Strategies - Richard Cleve Peter (Correct)
No context found.
M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115--1145, 1995.
Identifying Early Buyers from Purchase Data - Paat Rusmevichientong Cornell (Correct)
No context found.
M. Goemans and D. Williamson, "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming," J. of the ACM, vol. 42, pp. 1115-1145, 1995.
Unknown - (Correct)
No context found.
M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satis abil ity problems using semide nite programming. JACM, 42:1115-1145, 1995.
Random Projection, Margins, Kernels, and - Feature-Selection Avrim Blum (Correct)
No context found.
M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, pages 1115--1145, 1995.
Int. J. of Computational Science and Engineering, Vol. 1.. - Max-Cut Problem Sera (Correct)
No context found.
M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. ACMSIAM Symp. On Theory of Computing, pages 431--442, 1994.
Exploiting Semidefinite Relaxations in Constraint Programming - van Hoeve (2003) (Correct)
No context found.
M.X. Goemans and D.P. Williamson. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM, 42(6):1115--1145, 1995.
A Hybrid Constraint Programming and Semidefinite Programming.. - van Hoeve (2003) (Correct)
No context found.
M.X. Goemans and D.P. Williamson. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM, 42(6):1115--1145, 1995.
Unknown - (Correct)
No context found.
M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satis abil ity problems using semide nite programming. JACM, 42:1115-1145, 1995.
Semantic Similarity between Search Engine Queries Using.. - Chien, Immorlica (2005) (Correct)
No context found.
Michel X. Goemans and David P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. JACM, 42(6):1115--1145, 1995.
A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005) (Correct)
No context found.
M. Goemans and D. Williamson, "Improved approximation algorithms for maximum cut and satisfability problem using semidefinite programming," Journal of ACM, vol. 42, pp. 1115--1145, 1995. 24
A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005) (Correct)
No context found.
M. Goemans and D. Williamson, "Improved approximation algorithms for maximum cut and satisfability problem using semidefinite programming," Journal of ACM, vol. 42, pp. 1115--1145, 1995.
Approximation of dense-n/2-subgraph and table compression problems - Xu, Han, Du (Correct)
No context found.
Goemans, M. X., Williamson, D. P., Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming, Journal of ACM, 1995, 42: 1115-1145.
Semantic Similarity between Search Engine Queries Using.. - Chien, Immorlica (2005) (Correct)
No context found.
Michel X. Goemans and David P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. JACM, 42(6):1115--1145, 1995.
Constructing Test Functions for Global Optimization Using.. - Balasundaram, Butenko (2005) (Correct)
No context found.
Goemans, M. X. and Williamson, D. P., 1995, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of ACM, 42, 1115-1145.
Extended Frontiers in Optimization Techniques - Butenko, Pardalos (Correct)
No context found.
M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of ACM, 42: 1115-1145, 1995.
Computational Forensic Techniques for Intellectual.. - Wong, Kirovski.. (2004) (Correct)
No context found.
M Goemans and D. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, " J. ACM, vol. 42, no. 6, pp. 1115--1145, 1995.
Maximum Likelihood Detection of a MIMO System Using Second Order.. - Khan (Correct)
No context found.
M.X. Goemans and D.P. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming " Int. Journal of ACM, no.42, pp.1115-1145, 1995.
A Randomized Approximation Scheme for Metric MAX-CUT - Vega, Kenyon (2001) (17 citations) (Correct)
No context found.
M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115--1145, November 1995.
Semidefinite Programming and Combinatorial Optimization - Goemans (Correct)
No context found.
M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42:1115--1145, 1995.
On approximate graph colouring and MAX-k-CUT.. - de Klerk, Pasechnik.. (2000) (3 citations) (Correct)
No context found.
M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satis ability problems using semide nite programming. Journal of the ACM, 42(6):1115-1145, 1995.
Lift-and-Project Cutting Planes for Mixed 0-1 Semidefinite .. - Iyengar, Çezik (2001) (Correct)
No context found.
M. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satis ability problems using semide nite programming. Journal of ACM, 42:1115-1145, 1995.
The Simplex Method for Conic Programming - Goldfarb (2002) (Correct)
No context found.
M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satis ability problems using semide nite programming. Journal of ACM, 42:1115-1145, 1995.
Semidefinite Relaxations For The Traveling Salesman Problem - Cezik, Iyengar (2001) (Correct)
No context found.
M. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satis ability problems using semide nite programming. Journal of ACM, 42:1115-1145, 1995.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC