Faster SDP Hierarchy Solvers for Local Rounding Algorithms
暂无分享,去创建一个
[1] Venkatesan Guruswami,et al. Approximating Non-Uniform Sparsest Cut Via Generalized Spectra , 2013, SODA.
[2] Claire Mathieu,et al. Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack , 2011, IPCO.
[3] Prasad Raghavendra,et al. Rounding Semidefinite Programming Hierarchies via Global Correlation , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[4] 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.
[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] Dániel Marx,et al. Lower bounds based on the Exponential Time Hypothesis , 2011, Bull. EATCS.
[8] Leonid Khachiyan,et al. On the Complexity of Semidefinite Programs , 1997, J. Glob. Optim..
[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] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[11] Madhur Tulsiani,et al. Convex Relaxations and Integrality Gaps , 2012 .
[12] Thomas Rothvoß. Directed Steiner Tree and the Lasserre Hierarchy , 2011, ArXiv.
[13] Prasad Raghavendra,et al. Approximating Sparsest Cut in Graphs of Bounded Treewidth , 2010, APPROX-RANDOM.
[14] Prasad Raghavendra,et al. Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[15] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[16] Gyanit Singh,et al. Improved Approximation Guarantees through Higher Levels of SDP Hierarchies , 2008, APPROX-RANDOM.
[17] Subhash Khot,et al. SDP Integrality Gaps with Local ell_1-Embeddability , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[18] Monique Laurent,et al. A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..
[19] Sanjeev Arora,et al. New Tools for Graph Coloring , 2011, APPROX-RANDOM.
[20] Yuan Zhou,et al. Hypercontractivity, sum-of-squares proofs, and their applications , 2012, STOC '12.
[21] 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..
[22] Venkatesan Guruswami,et al. Optimal column-based low-rank matrix reconstruction , 2011, SODA.
[23] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[24] Prasad Raghavendra,et al. Approximating CSPs with global cardinality constraints using SDP hierarchies , 2011, SODA.