LNCS 1671 - Randomization, Approximation, and Combinatorial Optimization
College of Computing Georgia Institute of Technology
Untitled
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
PDF) Approximating Min-sum Set Cover
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
How to round any CSP
On the Lovász Theta Function for Independent Sets in Sparse Graphs | SIAM Journal on Computing | Vol. 47, No. 3 | Society for I
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
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
work appeared in SODA 10') Yuk Hei Chan (Tom) - ppt video online download
On semidefinite programming relaxations for graph coloring and vertex cover
Approximation Resistance from Pairwise-Independent Subgroups | Journal of the ACM
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
UC Berkeley
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
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing: On the Lovász Theta function for Independent Se
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
babel/karger.bib at master · zepheira/babel · GitHub
How to round any CSP
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute. - ppt download
Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations Yuan Zhou Computer Science Department Carnegie Mellon University. - ppt download
Linear programming relaxation - Wikipedia
