this paper, we are only concerned about the last question, which can be answered using semidefinite programming. For a survey of other aspects of such geometric representations, see [64].
|
789
|
Geometric Algorithms and Combinatorial Optimization, Springer-Verlag
– Grotschel, Lov'asz, et al.
- 1987
|
|
606
|
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
– Goemans, Williamson
- 1995
|
|
509
|
Proof verification and hardness of approximation problems
– Arora, Lund, et al.
- 1992
|
|
442
|
Semidefinite programming
– Vandenberghe, Boyd
- 1996
|
|
425
|
Some optimal inapproximability results
– Hastad
- 1997
|
|
387
|
Interior point methods in semidefinite programming with applications to combinatorial optimization
– Alizadeh
- 1995
|
|
262
|
Matroids and graphs
– Tutte
- 1959
|
|
224
|
On the Shannon capacity of a graph
– Lov'asz
- 1979
|
|
223
|
The ellipsoid method and its consequences in combinatorial optimization
– Grotschel, Lov'asz, et al.
- 1981
|
|
199
|
Interior point polynomial methods in convex programming: Theory and applications
– Nesterov, Nemirovsky
- 1994
|
|
177
|
Free bits, PCP and non-approximability - towards tight results
– Bellare, Goldreich, et al.
- 1998
|
|
165
|
Cones of matrices and set-functions and 0-1 optimization
– Lovász, Schrijver
- 1991
|
|
152
|
A lift-and-project cutting plane algorithm for mixed 0-1 programs
– Balas, Ceria, et al.
- 1993
|
|
128
|
Approximate graph coloring by semi-definite programming
– Karger, Motwani, et al.
|
|
120
|
Approximating maximum independent sets by excluding subgraphs. BIT
– Boppana, Halld'orsson
- 1992
|
|
100
|
A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems
– Sherali, Adams
- 1990
|
|
85
|
A 7/8-approximation algorithm for MAX 3SAT
– Karloff, Zwick
- 1997
|
|
80
|
Two-prover one-round proof systems: Their power and their problems
– Feige, Lovász
- 1992
|
|
79
|
Complementarity and nondegeneracy in semidefinite programming
– Alizadeh, Haeberly, et al.
- 1997
|
|
78
|
Approximating the bandwidth via volume respecting embeddings
– Feige
- 1998
|
|
71
|
On certain polytopes associated with graphs
– Chv'atal
- 1975
|
|
71
|
Kontaktprobleme der Konformen Abbildung
– Koebe
- 1936
|
|
61
|
On minimizing the maximum eigenvalue of a symmetric matrix
– Overton�
- 1988
|
|
57
|
Normal hypergraphs and the perfect graph conjecture, Discrete Mathematics 2
– Lovász
- 1972
|
|
48
|
The gap between monotone and non-monotone circuit complexity is exponential, Combinatorica 7
– Tardos
- 1987
|
|
44
|
Laplacian eigenvalues and the maximum cut problem
– Delorme, Poljak
- 1993
|
|
43
|
Polynomial algorithms for perfect graphs
– Grotschel, Lovasz, et al.
- 1984
|
|
38
|
The geometry and topology of three manifolds
– Thurston
- 1979
|
|
37
|
Randomized graph products, chromatic numbers, and the Lov'asz #-function
– Feige
- 1997
|
|
36
|
Explicit Ramsey graphs and orthonormal labelings
– Alon
- 1994
|
|
36
|
Nonpolyhedral relaxations of graph-bisection problems
– Poljak, Rendl
- 1992
|
|
36
|
An exact duality theory for semidefinite programming and its complexity implications
– RAMANA
- 1997
|
|
35
|
Approximating the independence number via the ` function
– Alon, Kahale
|
|
33
|
878-approximation algorithms for MAX
– Goemans, Williamson
- 1994
|
|
29
|
Rubber bands, convex embeddings and graph connectivity
– Linial, Lovász, et al.
- 1988
|
|
28
|
The algorithmic aspects of the Regularity
– Alon, Duke, et al.
- 1992
|
|
28
|
Colin de Verdi`ere, Multiplicit'es des valeurs propres et transformations 'etoile-triangle des graphes, preprint
– Bacher, Y
- 1994
|
|
27
|
The Sandwich Theorem, The Electronic
– Knuth
- 1994
|
|
26
|
Roth’s estimate of the discrepancy of integer sequences is nearly sharp
– Beck, Fiala
|
|
26
|
Stable sets and polynomials
– Lovasz
- 1994
|
|
26
|
Matroid Theory and its Applications to Electric Network Theory and
– Recski
- 1989
|
|
25
|
de Verdi`ere, On a new graph invariant and a criterion for planarity, in: Graph Structure Theory
– Colin
- 1993
|
|
21
|
On the sum of the largest eigenvalues of a symmetric matrix
– Overton, Womersley
- 1992
|
|
20
|
Combinatorial properties and the complexity of a max-cut approximation
– Delorme, Poljak
- 1993
|
|
20
|
A semidefinite bound for mixing rates of Markov chains
– Kahale
- 1996
|
|
19
|
Combinatorial optimization with semi-definite matrices
– Alizadeh
- 1992
|
|
19
|
Golumbic: Algorithmic Graph Theory and Perfect Graphs
– C
- 1980
|
|
19
|
On some problems of Lovász concerning the Shannon capacity of a graph
– Haemers
- 1979
|
|
18
|
The Shannon capacity of a union, Combinatorica 18
– Alon
- 1998
|
|
17
|
de Verdi`ere, Sur la multiplicit'e de la premi`ere valeur propre non nulle du laplacien
– Colin
- 1986
|
|
