M. Goemans, D. Williamson  Home/Search
Context Related
Links: ACM DBLP | ibm.com/cs/people/dpw/Cut/maxcut.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: core.ucl.ac.be/~glineur/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution to a nonlinear programming relaxation. This relaxation can be interpreted both as a semidefinite program and as an eigenvalue minimization problem. The best previously known approximation... (Update)
Cited by: More
Two Algorithms for Nearest-Neighbor Search in High Dimensions - Kleinberg (1997) (Correct)
Geometry of Semide - Nite Max-Cut Relaxations (Correct)
Consequences and Limits of Nonlocal Strategies - Richard Cleve Peter (Correct)
Similar documents (at the sentence level):
49.5%: Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (Correct)
Active bibliography (related documents): More All
0.8: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
0.7: Efficient Approximation Algorithms for Some Semidefinite Programs - Lu (1996) (Correct)
0.6: On a Positive Semidefinite Relaxation of the Cut Polytope - Laurent, Poljak (1993) (Correct)
Similar documents based on text: More All
0.3: Combinatorial Approximation Algorithms for the Maximum.. - Halperin, Zwick (2001) (Correct)
0.3: A New 3/4-Approximation Algorithm for MAX SAT - Goemans, Williamson (1994) (Correct)
0.1: Artwork Analysis Tools for VLSI Circuits - Baker (Correct)
Related documents from co-citation: More All
24: Interior point methods in semidefinite programming with applications to combinat.. - ALIZADEH - 1995
20: Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lov'asz et al. - 1993
18: Semidefinite Programming - Vandenberghe, Boyd - 1994
BibTeX entry: (Update)
M.X. GOEMANS and D.P. WILLIAMSON. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of Association for Computing Machinery, 42(6):1115--1145, 1995. http://citeseer.ist.psu.edu/goemans95improved.html More
@article{ goemans95improved,
author = "Michel X. Goemans and David P. Williamson",
title = "{Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming}",
journal = "{J. Assoc. Comput. Mach.}",
volume = "42",
pages = "1115--1145",
year = "1995",
url = "citeseer.ist.psu.edu/goemans95improved.html" }
Citations (may not include all citations):2441 The Johns Hopkins University Press (context) - Golub, Van Loan - 1983
773 Reducibility among combinatorial problems (context) - Karp - 1972
537 Graph Theory with Applications (context) - Bondy, Murty - 1976
529 Linear Matrix Inequalities in System and Control Theory (context) - Boyd, Ghaoui et al. - 1994
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
333 Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lov'asz et al. - 1988
307 Interior Point Polynomial Methods in Convex Programming (context) - Nesterov, Nemirovskii - 1994
250 volume 2 of The Art of Computer Programming (context) - Knuth - 1981
230 Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
225 Some simplified NP-complete graph problems (context) - Garey, Johnson et al. - 1976 DBLP
219 and complexity classes (context) - Papadimitriou, Yannakakis et al. - 1991
171 The Theory of Matrices (context) - Lancaster, Tismenetsky - 1985
124 TSPLIB -- A traveling salesman problem library (context) - Reinelt - 1991
117 The ellipsoid method and its consequences in combinatorial o.. (context) - Grotschel, Lov'asz et al. - 1981 DBLP
115 Approximating the value of two prover proof systems (context) - Feige, Goemans - 1995
115 PCP and non-approximability --- Towards tight results (context) - Bellare, Goldreich et al. - 1995
112 Improved approximation algorithms for MAX k-CUT and MAX BISE.. - Frieze, Jerrum - 1995 ACM DBLP
107 complete approximation problems (context) - Sahni, Gonzalez - 1976
106 approximation algorithms for MAX CUT and MAX 2SAT (context) - Goemans, Williamson - 1994
99 Approximate graph coloring by semidefinite programming - Karger, Motwani et al. - 1994 ACM DBLP
93 IEEE Transactions on Information Theory (context) - Lov'asz, Shannon et al. - 1979
85 the approximation of maximum satisfiability (context) - Yannakakis - 1994
75 Approximation algorithms for the set covering and vertex cov.. (context) - Hochbaum - 1982 DBLP
69 Two-prover one-round proof systems: Their power and their pr.. (context) - Feige, Lov'asz - 1992
67 A new algorithm for minimizing convex functions over convex .. (context) - Vaidya - 1989 ACM
48 Self-Concordant Functions and Polynomial Time Methods in Con.. (context) - Nesterov, Nemirovskii - 1989
47 Springer-Verlag (context) - Berger - 1987
46 Laplacian eigenvalues and the maximum cut problem (context) - Delorme, Poljak - 1993 ACM
39 Optimality conditions and duality theory for minimizing sums.. - Overton, Womersley - 1993 ACM
36 An application of combinatorial optimization to statistical .. (context) - Barahona, Grotschel et al. - 1988
36 Finding a maximum cut of a planar graph in polynomial time (context) - Hadlock - 1975 DBLP
35 Some applications of optimization in matrix theory (context) - Wolkowicz - 1981
35 Nonpolyhedral relaxations of graph-bisection problems - Poljak, Rendl - 1992
28 New 3/4-approximation algorithms for the maximum satisfiabil.. (context) - Goemans, Williamson - 1994 DBLP
28 A geometric approach to betweenness - Chor, Sudan - 1995
23 Solving the max-cut problem using eigenvalues (context) - Poljak, Rendl - 1995 ACM DBLP
21 A linear time approximation algorithm for the weighted verte.. (context) - Bar-Yehuda, Even - 1981
21 Combinatorial properties and the complexity of a max-cut app.. (context) - Delorme, Poljak - 1993
20 the sum of the largest eigenvalues of a symmetric matrix (context) - Overton, Womersley - 1992
15 Finding the maximal cut in a graph (context) - Orlova, Dorfman - 1972
15 The max-cut problem --- a survey (context) - Poljak, Tuza - 1995
14 Problems of distance geometry and convex properties of quadr.. (context) - Barvinok - 1995 DBLP
13 Personal communication (context) - Hall - 1994
13 Interior point methods for max-min eigenvalue problems (context) - Rendl, Vanderbei et al. - 1993
12 Cones of matrices and setfunctions (context) - Lov'asz, Schrijver - 1990
11 The performance of an eigenvalue bound on the max-cut proble.. (context) - Delorme, Poljak - 1993 ACM
10 Approximation and intractability results for the maximum cut.. (context) - Haglin, Venkatesan - 1991 ACM DBLP
10 On cone-LP's and semi-definite programs: Facial structure (context) - Pataki - 1995
9 Linear Algebra and its Applications (context) - Grone, Pierce et al. - 1990
7 A note on extreme positive definite matrices (context) - Christensen, Vesterstrm - 1979
6 Eigenvalue methods in combinatorial optimization (context) - Mohar, Poljak - 1993
6 Approximating maximum 2-CNF satisfiability - Haglin - 1992 DBLP
6 A polynomial algorithm for constructing a large bipartite su.. (context) - Poljak, Turz'ik - 1982
5 A note on extreme correlation matrices (context) - Li, Tam - 1994 ACM
5 Node and edge relaxations of the max-cut problem - Poljak, Rendl - 1994
5 and stable set polyhedra (context) - Lov'asz, Schrijver et al. - 1989
5 Combinatorial optimization: Some problems and trends (context) - Lov'asz - 1992
4 Correctly derandomizing Goemans and Williamson's Max CUT alg.. (context) - Mahajan, Ramesh - 1995
4 the facial structure of the set of correlation matrices - Laurent, Poljak - 1995
4 Submitted to SIAM Review (context) - Vandenberghe, Boyd - 1994
4 How well can a graph be n-colored (context) - Vit'anyi - 1981
4 De mensura angulorum solidorum (context) - Euler
4 Personal communication (context) - Haglin - 1994
4 Invention nouvelle en l'alg`ebre (context) - Girard, de la et al.
4 A combinatorial design approach to MAXCUT (context) - Hofmeister, Lefmann - 1995 ACM DBLP
4 Personal communication (context) - Junger - 1994
4 A history of non-Euclidean geometry (context) - Rosenfeld - 1988
3 Management Science Research Report MSRR (context) - Pataki, multiplicity et al. - 1994
3 Extreme points of a convex subset of the cone of positive de.. (context) - Loewy - 1980
2 highly parallel implementation GoemanWilliamson algorithm to.. (context) - Peinado, implementation et al. - 1994
2 Self-dual polytopes and the chromatic number of distance gra.. (context) - Lov'asz - 1983
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.core.ucl.ac.be/~glineur/): More
An Extended Conic Formulation - For Geometric Optimization (Correct)
Topics In Convex Optimization: Interior-Point Methods, Conic.. - Glineur (Correct)
SIAG/OPT Views-and-News - Forum For The (Correct)
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