Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
暂无分享,去创建一个
[1] O. Svensson,et al. Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling , 2007, FOCS 2007.
[2] Madhur Tulsiani. CSP gaps and reductions in the lasserre hierarchy , 2009, STOC '09.
[3] Cynthia A. Phillips,et al. Finding minimum-quotient cuts in planar graphs , 1993, STOC.
[4] Venkatesan Guruswami,et al. Optimal column-based low-rank matrix reconstruction , 2011, SODA.
[5] Jean B. Lasserre,et al. An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..
[6] James R. Lee,et al. Metric Uniformization and Spectral Bounds for Graphs , 2010, ArXiv.
[7] Santosh S. Vempala,et al. Adaptive Sampling and Fast Low-Rank Matrix Approximation , 2006, APPROX-RANDOM.
[8] Nisheeth K. Vishnoi,et al. The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.
[9] Luis Rademacher,et al. Efficient Volume Sampling for Row/Column Subset Selection , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[10] Sandy Irani,et al. The Power of Quantum Systems on a Line , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[11] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[12] Gyanit Singh,et al. Improved Approximation Guarantees through Higher Levels of SDP Hierarchies , 2008, APPROX-RANDOM.
[13] Konstantin Makarychev,et al. How to Play Unique Games on Expanders , 2010, WAOA.
[14] Vahab Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.
[15] 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.
[16] Christos Boutsidis,et al. Near Optimal Column-Based Matrix Reconstruction , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[17] Uriel Feige,et al. Resolution lower bounds for the weak pigeon hole principle , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[18] Luca Trevisan,et al. Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[19] Nisheeth K. Vishnoi,et al. Unique games on expanding constraint graphs are easy: extended abstract , 2008, STOC '08.
[20] Alexandra Kolla. Spectral Algorithms for Unique Games , 2010, Computational Complexity Conference.
[21] Grant Schoenebeck,et al. Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[22] Eden Chlamtác. Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[23] Venkatesan Guruswami,et al. Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives , 2011, Electron. Colloquium Comput. Complex..
[24] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[25] Prasad Raghavendra,et al. Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.
[26] Madhur Tulsiani,et al. Convex Relaxations and Integrality Gaps , 2012 .
[27] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[28] Subhash Khot. Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique , 2004, FOCS.
[29] Prasad Raghavendra,et al. Reductions between Expansion Problems , 2010, 2012 IEEE 27th Conference on Computational Complexity.
[30] Venkatesan Guruswami,et al. Improved Column-Based Low-Rank Matrix Reconstruction , 2011 .
[31] Sanjeev Arora,et al. Subexponential Algorithms for Unique Games and Related Problems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[32] Prasad Raghavendra,et al. Graph expansion and the unique games conjecture , 2010, STOC '10.
[33] Prasad Raghavendra,et al. Rounding Semidefinite Programming Hierarchies via Global Correlation , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[34] Subhash Khot,et al. Approximate Lasserre Integrality Gap for Unique Games , 2010, APPROX-RANDOM.
[35] Claire Mathieu,et al. Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack , 2011, IPCO.
[36] Magnús M. Halldórsson,et al. Approximations of Independent Sets in Graphs , 1998, APPROX.