暂无分享,去创建一个
[1] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[2] Prasad Raghavendra,et al. Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[3] James R. Lee,et al. Metric Uniformization and Spectral Bounds for Graphs , 2010, ArXiv.
[4] M. Halld. Approximations of Independent Sets in Graphs , .
[5] Rishi Saket,et al. SDP Integrality Gaps with Local̀ 1-Embeddability Subhash Khot , 2009 .
[6] Jean B. Lasserre,et al. An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..
[7] Kevin J. Lang,et al. An algorithm for improving graph partitions , 2008, SODA '08.
[8] R. Oliveira. The spectrum of random k-lifts of large graphs (with possibly large k) , 2009, 0911.4741.
[9] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[10] Alexandra Kolla. Spectral Algorithms for Unique Games , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.
[11] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[12] Luca Trevisan,et al. Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[13] Subhash Khot,et al. SDP Integrality Gaps with Local ell_1-Embeddability , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[14] Uriel Feige,et al. Relations between average case complexity and approximation complexity , 2002, STOC '02.
[15] 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.
[16] Magnús M. Halldórsson,et al. Approximations of Independent Sets in Graphs , 1998, APPROX.
[17] Sanjeev Arora,et al. Subexponential Algorithms for Unique Games and Related Problems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[18] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[19] Grant Schoenebeck,et al. Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[20] Hanif D. Sherali,et al. A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..
[21] Elchanan Mossel,et al. Majority is stablest: discrete and SoS , 2012, STOC '13.
[22] Konstantin Makarychev,et al. How to Play Unique Games on Expanders , 2010, WAOA.
[23] Prasad Raghavendra,et al. Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.
[24] Madhur Tulsiani,et al. Convex Relaxations and Integrality Gaps , 2012 .
[25] Prasad Raghavendra,et al. Reductions between Expansion Problems , 2010, 2012 IEEE 27th Conference on Computational Complexity.
[26] Prasad Raghavendra,et al. Graph expansion and the unique games conjecture , 2010, STOC '10.
[27] Subhash Khot,et al. Approximate Lasserre Integrality Gap for Unique Games , 2010, APPROX-RANDOM.
[28] 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.
[29] Yuan Zhou,et al. Approximability and proof complexity , 2012, SODA.
[30] Ola Svensson,et al. Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut , 2011, SIAM J. Comput..
[31] Sanjeev Arora,et al. New Tools for Graph Coloring , 2011, APPROX-RANDOM.
[32] Prasad Raghavendra,et al. Rounding Semidefinite Programming Hierarchies via Global Correlation , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[33] Venkatesan Guruswami,et al. Approximating Non-Uniform Sparsest Cut Via Generalized Spectra , 2013, SODA.
[34] Claire Mathieu,et al. Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack , 2011, IPCO.
[35] Eden Chlamtác. Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[36] Michael Dinitz,et al. Everywhere-Sparse Spanners via Dense Subgraphs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[37] Christos Boutsidis,et al. Near-Optimal Column-Based Matrix Reconstruction , 2014, SIAM J. Comput..
[38] Nisheeth K. Vishnoi,et al. Unique games on expanding constraint graphs are easy: extended abstract , 2008, STOC.
[39] Monique Laurent,et al. A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..
[40] Yuan Zhou,et al. Hypercontractivity, sum-of-squares proofs, and their applications , 2012, STOC '12.
[41] Madhur Tulsiani. CSP gaps and reductions in the lasserre hierarchy , 2009, STOC '09.
[42] Santosh S. Vempala,et al. Adaptive Sampling and Fast Low-Rank Matrix Approximation , 2006, APPROX-RANDOM.
[43] Nisheeth K. Vishnoi,et al. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.
[44] Luis Rademacher,et al. Efficient Volume Sampling for Row/Column Subset Selection , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[45] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[46] Gyanit Singh,et al. Improved Approximation Guarantees through Higher Levels of SDP Hierarchies , 2008, APPROX-RANDOM.
[47] Cynthia A. Phillips,et al. Finding minimum-quotient cuts in planar graphs , 1993, STOC.
[48] Venkatesan Guruswami,et al. Optimal column-based low-rank matrix reconstruction , 2011, SODA.
[49] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[50] Venkatesan Guruswami,et al. Faster SDP Hierarchy Solvers for Local Rounding Algorithms , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[51] Prasad Raghavendra,et al. Approximating CSPs with global cardinality constraints using SDP hierarchies , 2011, SODA.