Michel X. Goemans  Home/Search
Context Related
| mit.edu/~goemans/semidefsurvey.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: mit.edu/~goemans (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the Lovasz theta function and its applications to stable sets, perfect graphs, and coding theory, (ii) the automatic generation of strong valid inequalities, (iii) the maximum cut problem and related problems, and (iv) the embedding of finite metric spaces and its relationship to the sparsest cut problem. (Update)
Cited by: More
Small Journal Name, ?, 1--18 (199?) - Solving Euclidean Distance (Correct)
Selecting Canonical Views for View-Based 3-D Object.. - Denton, Demirci.. (2004) (Correct)
Semidefinite Programming and Combinatorial Optimization - Goemans (Correct)
Active bibliography (related documents): More All
1.0: Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (Correct)
0.6: Efficient Approximation Algorithms for Some Semidefinite Programs - Lu (1996) (Correct)
0.5: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
Similar documents based on text: More All
0.5: When Does The Positive Semidefiniteness Constraint Help.. - Goemans, Tunçel (2000) (Correct)
0.4: Lattice Basis Reduction and Integer Programming - Aardal (1999) (Correct)
0.4: Non-Standard Approaches to Integer Programming - Aardal, Weismantel, Wolsey (1999) (Correct)
Related documents from co-citation: More All
31: Improved approximation algorithms for maximum cut and satisfiability problems us.. - GOEMANS, WILLIAMSON - 1995
30: An interior-- point method for semidefinite programming - Helmberg, Rendl et al. - 1996
30: Interior point methods in semidefinite programming with applications to combinat.. - ALIZADEH - 1995
BibTeX entry: (Update)
M.X. Goemans, Semidefinite programming in combinatorial optimization, Math. Programming, Vol. 79: 143--161, 1997. http://citeseer.ist.psu.edu/article/goemans97semidefinite.html More
@article{ goemans97semidefinite,
author = "M. X. Goemans",
title = "Semidefinite programming in combinatorial optimization",
journal = "Mathematical Programming",
volume = "79",
pages = "143--161",
year = "1997",
url = "citeseer.ist.psu.edu/article/goemans97semidefinite.html" }
Citations (may not include all citations):860 The theory of error correcting codes (context) - MacWilliams, Sloane - 1977
708 Cambridge University Press (context) - Horn, Johnson - 1985
488 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
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
276 Semidefinite programming - Vandenberghe, Boyd - 1996
230 Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
171 The Theory of Matrices (context) - Lancaster, Tismenetsky - 1985
170 The geometry of graphs and some of its algorithmic applicati.. - Linial, London et al. - 1995
168 An approximate max-flow min-cut theorem for uniform multicom.. (context) - Leighton, Rao - 1988
126 Eigenvalues and expanders (context) - Alon - 1986
120 Some optimal inapproximability results (context) - Hastad - 1997
117 The ellipsoid method and its consequences in combinatorial o.. (context) - Grotschel, Lov'asz et al. - 1981
117 A lift-and-project cutting plane algorithm for mixed 0-1 pro.. (context) - Balas, Ceria et al. - 1993
115 Approximating the value of two prover proof systems (context) - Feige, Goemans - 1995
112 Improved approximation algorithms for MAX k-CUT and MAX BISE.. - Frieze, Jerrum - 1997
99 Approximate graph coloring by semidefinite programming - Karger, Motwani et al. - 1994
80 An algebraic approach to the association schemes of coding t.. (context) - Delsarte - 1973
75 Approximation algorithms for the set covering and vertex cov.. (context) - Hochbaum - 1982
73 uniform generation and rapidly mixing markov chains (context) - Sinclair, Jerrum - 1989
66 On Lipschitz embedding of finite metric spaces in Hilbert sp.. (context) - Bourgain - 1985
60 IEEE Transactions on Information Theory (context) - Lov'asz, Shannon et al. - 1979
57 Eigenvalue optimization - Lewis, Overton - 1996
50 A hierarchy of relaxations between the continuous and convex.. (context) - Sherali, Adams - 1990
47 Clique is hard to approximate within n 1\Gammaffl (context) - Hastad - 1996
46 Laplacian eigenvalues and the maximum cut problem (context) - Delorme, Poljak - 1993
42 approximate min-cut max-flow theorem and approximation algor.. - Aumann, Rabani et al.
36 Derandomizing semidefinite programming based approximation a.. (context) - Mahajan, Ramesh - 1995
35 Nonpolyhedral relaxations of graph-bisection problems - Poljak, Rendl - 1995
33 Mathematical Programming (context) - Barahona, Mahjoub et al. - 1986
30 isoperimetric inequalities for graphs and superconcentrators (context) - Alon, Milman - 1985
28 How good is the Goemans-Williamson MAX CUT algorithm (context) - Karloff - 1996
28 A geometric approach to betweenness - Chor, Sudan - 1995
27 Quality of semidefinite relaxation for nonconvex quadratic o.. (context) - Nesterov - 1997
25 Expressing combinatorial optimization problems by linear pro.. (context) - Yannakakis - 1988
23 Randomized graph products (context) - Feige - 1995
23 Approximating the independence number via the ` function (context) - Alon, Kahale - 1994
22 Connections between the semidefinite relaxations of the max-.. - Laurent, Poljak et al. - 1996
21 Combinatorial properties and the complexity of a max-cut app.. (context) - Delorme, Poljak - 1993
21 Cones of matrices and setfunctions (context) - Lov'asz, Schrijver - 1991
18 The Lov'asz theta function and a semidefinite programming re.. - Kleinberg, Goemans
17 Algorithms and Combinatorics (context) - Deza, Laurent et al. - 1997
17 Electronic Journal of Combinatorics (context) - Knuth, theorem - 1994
14 Problems of distance geometry and convex properties of quadr.. (context) - Barvinok - 1995
10 Relaxations of vertex packing (context) - Grotschel, Lov'asz et al. - 1986
10 Courant Institute of Mathematical Sciences (context) - Alizadeh, Haeberly et al. - 1995
10 On cone-LP's and semi-definite programs: Facial structure (context) - Pataki - 1995
8 Semidefinite programming and combinatorial optimization - Rendl - 1997
8 Maximum cuts and largest bipartite subgraphs (context) - Poljak, Tuza - 1995
6 Eigenvalue methods in combinatorial optimization (context) - Mohar, Poljak - 1993
6 and stable set polyhedra (context) - Lov'asz, Schrijver et al. - 1989
6 Association schemes (context) - Brouwer, Haemers - 1995
5 Perfect graphs (context) - Lov'asz - 1983
4 Combinatorial optimization: Some problems and trends (context) - Lov'asz - 1992
4 IEEE Transactions on Information Theory (context) - Schrijver, of et al. - 1979
4 Polyhedral and eigenvalue approximations of the max-cut prob.. (context) - Poljak - 1992
3 New upper bounds on the rate of a code via the Delsarte-McWi.. (context) - McEliece, Rodemich et al. - 1977
2 A problem that is easier to solve on the unit-cost algebraic.. (context) - Tiwari - 1992
2 A note on the theta number of Lov'asz and the generalized De.. (context) - Szegedy - 1994
1 IRE Transactions on Information Theory (context) - Shannon, error et al. - 1956
1 An effective version of Kronecker's theorem on simultaneous .. - Malajovich - 1996
1 and their applications to coding theory (context) - McEliece, of et al. - 1979
1 Interior-point methods for semidefinite programming (context) - Kojima - 1997
1 The asymptotic behavior of Lov'asz' # function for random gr.. (context) - Juh'asz - 1982
1 Vertex cover eludes the Schrijver function (context) - Lagergren, Russell - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-math.mit.edu/~goemans): More
Semidefinite Programs and Association Schemes - Goemans, Rendl (1999) (Correct)
Semidefinite Programming and Combinatorial Optimization - Goemans (Correct)
Approximate Edge Splitting - Goemans (1999) (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