Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations Yuan Zhou Computer Science Department Carnegie Mellon University. - ppt download
Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations Yuan Zhou Computer Science Department Carnegie Mellon University. - ppt download
work appeared in SODA 10') Yuk Hei Chan (Tom) - ppt video online download
work appeared in SODA 10') Yuk Hei Chan (Tom) - ppt video online download
On the Lovász Theta Function for Independent Sets in Sparse Graphs | SIAM Journal on Computing | Vol. 47, No. 3 | Society for I
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
work appeared in SODA 10') Yuk Hei Chan (Tom) - ppt video online download
Approximation Resistance from Pairwise-Independent Subgroups | Journal of the ACM
On semidefinite programming relaxations for graph coloring and vertex cover
Semidefinite Programming in Combinatorial Optimization | Request PDF
Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations Yuan Zhou Computer Science Department Carnegie Mellon University. - ppt download
How to round any CSP
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
work appeared in SODA 10') Yuk Hei Chan (Tom) - ppt video online download
How to round any CSP
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Eric Blais Klaus Jansen José D. P. Roli
Semidefinite Programming in Combinatorial Optimization | Request PDF
work appeared in SODA 10') Yuk Hei Chan (Tom) - ppt video online download
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
How to round any CSP
arXiv:1305.5998v2 [cs.DS] 18 Jul 2013
Untitled
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
