暂无分享,去创建一个
[1] Moses Charikar,et al. Local Global Tradeoffs in Metric Embeddings , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[2] Mihalis Yannakakis,et al. Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..
[3] Ryan O'Donnell,et al. Sum of squares lower bounds for refuting any CSP , 2017, STOC.
[4] Nisheeth K. Vishnoi,et al. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.
[5] P. Parrilo. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .
[6] Sanjeev Arora,et al. Subexponential Algorithms for Unique Games and Related Problems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[7] Prasad Raghavendra,et al. Graph expansion and the unique games conjecture , 2010, STOC '10.
[8] Yuan Zhou,et al. Hypercontractivity, sum-of-squares proofs, and their applications , 2012, STOC '12.
[9] Guy Kindler,et al. On non-optimally expanding sets in Grassmann graphs , 2017, Electron. Colloquium Comput. Complex..
[10] Sepehr Abbasi Zadeh. Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies , 2018 .
[11] Nisheeth K. Vishnoi,et al. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l/sub 1/ , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[12] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[13] Prasad Raghavendra,et al. Reductions between Expansion Problems , 2010, 2012 IEEE 27th Conference on Computational Complexity.
[14] Guy Kindler,et al. Towards a proof of the 2-to-1 games conjecture? , 2018, Electron. Colloquium Comput. Complex..
[15] 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..
[16] Sanjeev Arora,et al. Euclidean distortion and the sparsest cut , 2005, Symposium on the Theory of Computing.
[17] George Karakostas,et al. A better approximation ratio for the vertex cover problem , 2005, TALG.
[18] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[19] James R. Lee,et al. Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.
[20] Konstantinos Georgiou,et al. Better Balance by Being Biased , 2016, ACM Trans. Algorithms.
[21] Yurii Nesterov,et al. Squared Functional Systems and Optimization Problems , 2000 .
[22] Dima Grigoriev,et al. Complexity of Positivstellensatz proofs for the knapsack , 2002, computational complexity.
[23] Russell Impagliazzo,et al. On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..
[24] Jean B. Lasserre,et al. An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..
[25] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[26] Yuval Rabani,et al. On the Hardness of Approximating Multicut and Sparsest-Cut , 2005, Computational Complexity Conference.
[27] Subhash Khot,et al. On independent sets, 2-to-2 games, and Grassmann graphs , 2017, Electron. Colloquium Comput. Complex..
[28] Vangelis Th. Paschos,et al. Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms , 2011, Discret. Appl. Math..
[29] Amit Agarwal,et al. O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.
[30] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[31] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[32] Subhash Khot,et al. Optimal Long Code Test with One Free Bit , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[33] Russell Impagliazzo,et al. Improved Algorithms for Unique Games via Divide and Conquer , 2010, Electron. Colloquium Comput. Complex..
[34] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[35] Uriel Feige,et al. Relations between average case complexity and approximation complexity , 2002, STOC '02.
[36] Subhash Khot,et al. Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[37] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[38] Prasad Raghavendra,et al. A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs , 2016, ICALP.
[39] Prasad Raghavendra,et al. Rounding Semidefinite Programming Hierarchies via Global Correlation , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[40] Yuan Zhou,et al. Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems , 2014, ITCS.
[41] James R. Lee,et al. An improved approximation ratio for the minimum linear arrangement problem , 2007, Inf. Process. Lett..
[42] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.
[43] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[44] Ryan O'Donnell,et al. SOS Is Not Obviously Automatizable, Even Approximately , 2016, ITCS.
[45] Venkatesan Guruswami,et al. Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[46] Philip N. Klein,et al. Approximation Algorithms for Steiner and Directed Multicuts , 1997, J. Algorithms.
[47] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[48] David Steurer,et al. Sum-of-squares proofs and the quest toward optimal algorithms , 2014, Electron. Colloquium Comput. Complex..
[49] Ewald Speckenmeyer,et al. Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.
[50] Ran Raz,et al. Two Query PCP with Sub-Constant Error , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[51] Nikhil Bansal,et al. New Tools and Connections for Exponential-Time Approximation , 2017, Algorithmica.
[52] James R. Lee,et al. On distance scales, embeddings, and efficient relaxations of the cut cone , 2005, SODA '05.
[53] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[54] Ryan O'Donnell,et al. Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..
[55] Grant Schoenebeck,et al. Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[56] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..
[57] Subhash Khot,et al. Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[58] Yuan Zhou,et al. Approximability and proof complexity , 2012, SODA.