暂无分享,去创建一个
[1] Sanjeev Arora,et al. 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n2) Time , 2004, FOCS.
[2] Anupam Gupta,et al. Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut , 2005, SODA '05.
[3] A. Sinclair,et al. Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs , 2005 .
[4] Amit Agarwal,et al. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.
[5] Konstantin Makarychev,et al. How to Play Unique Games Using Embeddings , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[6] Sanjeev Arora,et al. Euclidean distortion and the sparsest cut , 2005, Symposium on the Theory of Computing.
[7] George Karakostas,et al. A better approximation ratio for the vertex cover problem , 2005, TALG.
[8] Sanjeev Arora,et al. A combinatorial, primal-dual approach to semidefinite programs , 2007, STOC.
[9] Jonah Sherman,et al. Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.