APPROXIMATING MAXIMUM STABLE SET AND MINIMUM GRAPH COLORING PROBLEMS WITH THE POSITIVE SEMIDEFINITE RELAXATION

by S. J. Benson, Y. Ye
Citations:9 - 1 self

Documents Related by Co-Citation

139 A Spectral Bundle Method for Semidefinite Programming – C. Helmberg, F. Rendl - 1997
952 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995
339 On the Shannon capacity of a graph – L Lovász - 1979
1149 Geometric algorithms and combinatorial optimization – M Grötschel, L Lovász, A Schrijver - 1988
24 Solving a Class of Semidefinite Programs via Nonlinear Programming – Samuel Burer, Renato D.C. Monteiro, Yin Zhang - 2001
506 Computer Solutions of Large Sparse Positive Definite Systems – J A George, J W Liu - 1981
4756 Matrix Analysis – R A Horn, C R Johnson - 2012
480 Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization – Farid Alizadeh - 1993
1976 Numerical Optimization – J Nocedal, S J Wright - 2000