Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations Yuan Zhou Computer Science Department Carnegie Mellon University. - ppt download
LNCS 1671 - Randomization, Approximation, and Combinatorial Optimization
How to round any CSP
Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations Yuan Zhou Computer Science Department Carnegie Mellon University. - ppt download
Approximation Resistance from Pairwise-Independent Subgroups | Journal of the ACM
How to round any CSP
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
Semidefinite Programming in Combinatorial Optimization | Request PDF
How to round any CSP
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing: On the Lovász Theta function for Independent Se
Linear programming relaxation - Wikipedia
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
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
LNCS 2764 - Approximation, Randomization, and Combinatorial Optimization.
On semidefinite programming relaxations for graph coloring and vertex cover
arXiv:1305.5998v2 [cs.DS] 18 Jul 2013
work appeared in SODA 10') Yuk Hei Chan (Tom) - ppt video online download
College of Computing Georgia Institute of Technology
Integer Programming and Combinatorial Optimization (Lecture Notes in Computer Science, 6655)
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
PDF) Approximating Min-sum Set Cover
Semidefinite Programming in Combinatorial Optimization | Request PDF
Untitled
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
