SDP gaps and UGC-hardness for MAXCUTGAIN
暂无分享,去创建一个
[1] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[2] J. Krivine. Constantes de Grothendieck et fonctions de type positif sur les sphères , 1979 .
[3] C. Borell. Geometric bounds on the Ornstein-Uhlenbeck velocity process , 1985 .
[4] U. Haagerup. A new upper bound for the complex Grothendieck constant , 1987 .
[5] M. Talagrand,et al. Probability in Banach spaces , 1991 .
[6] Harald Cram'er,et al. Sur un nouveau théorème-limite de la théorie des probabilités , 2018 .
[7] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[8] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[9] A. Grothendieck. Résumé de la théorie métrique des produits tensoriels topologiques , 1996 .
[10] Luca Trevisan,et al. Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[11] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[12] Y. Nesterov. Global quadratic optimization via conic relaxation , 1998 .
[13] Tamás Terlaky,et al. On maximization of quadratic form over intersection of ellipsoids with common center , 1999, Math. Program..
[14] Uri Zwick,et al. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems , 1999, STOC '99.
[15] Noga Alon,et al. Constructing worst case instances for semidefinite programming based approximation algorithms , 2001, SODA '01.
[16] Michael Langberg,et al. The RPR2 rounding technique for semidefinite programs , 2001, J. Algorithms.
[17] A. Megretski. Relaxations of Quadratic Programs in Operator Theory and System Analysis , 2001 .
[18] Uriel Feige,et al. On the integrality ratio of semidefinite relaxations of MAX CUT , 2001, STOC '01.
[19] Luca Trevisan,et al. On Weighted vs Unweighted Versions of Combinatorial Optimization Problems , 2001, Inf. Comput..
[20] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[21] Srinivasan Venkatesh,et al. On the advantage over a random assignment , 2002, STOC '02.
[22] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[23] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[24] B. Green. A Szemerédi-type regularity lemma in abelian groups, with applications , 2003, math/0310476.
[25] Moses Charikar,et al. Maximizing quadratic programs: extending Grothendieck's inequality , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[26] Uriel Feige,et al. On Systems of Linear Equations with Two Variables per Equation , 2004, APPROX-RANDOM.
[27] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[28] Avrim Blum,et al. Correlation Clustering , 2004, Machine Learning.
[29] Noga Alon,et al. Approximating the cut-norm via Grothendieck's inequality , 2004, STOC '04.
[30] Amit Agarwal,et al. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.
[31] Nisheeth K. Vishnoi,et al. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into 1 (Extended Abstract) , 2005 .
[32] Nisheeth K. Vishnoi,et al. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.
[33] Guy Kindler,et al. On non-approximability for quadratic programs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[34] Yuval Rabani,et al. ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[35] Y. Rabani,et al. Improved lower bounds for embeddings into L 1 , 2006, SODA 2006.
[36] Elchanan Mossel,et al. Conditional hardness for approximate coloring , 2005, STOC '06.
[37] Moses Charikar,et al. Near-optimal algorithms for unique games , 2006, STOC '06.
[38] A. Naor,et al. Nonembeddability theorems via Fourier analysis , 2006 .
[39] N. Alon,et al. Quadratic forms on graphs , 2006 .
[40] Yuval Rabani,et al. Improved lower bounds for embeddings into L1 , 2006, SODA '06.
[41] Ryan O'Donnell,et al. Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..
[42] Elchanan Mossel,et al. Noise stability of functions with low influences: Invariance and optimality , 2005, IEEE Annual Symposium on Foundations of Computer Science.
[43] Prasad Raghavendra,et al. Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.
[44] Ryan O'Donnell,et al. An optimal sdp algorithm for max-cut, and equally optimal long code tests , 2008, STOC.
[45] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..