暂无分享,去创建一个
[1] Rico Zenklusen,et al. Hardness and approximation for network flow interdiction , 2015, Networks.
[2] Dima Grigoriev,et al. Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity , 2001, Theor. Comput. Sci..
[3] Kazuoki Azuma. WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .
[4] Prasad Raghavendra,et al. Graph expansion and the unique games conjecture , 2010, STOC '10.
[5] Scott Duke Kominers,et al. Orienteering for electioneering , 2017, Oper. Res. Lett..
[6] Kevin A. Lai,et al. Label optimal regret bounds for online local learning , 2015, COLT.
[7] Aravindan Vijayaraghavan,et al. Approximation Algorithms for Label Cover and The Log-Density Threshold , 2017, SODA.
[8] Grant Schoenebeck,et al. Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[9] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[10] Michael Dinitz,et al. Everywhere-Sparse Spanners via Dense Subgraphs , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[11] Avi Wigderson,et al. Public-key cryptography from different assumptions , 2010, STOC '10.
[12] Aditya Bhaskara,et al. Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.
[13] Prasad Raghavendra,et al. On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique , 2016, SODA.
[14] Uriel Feige,et al. Resolution lower bounds for the weak pigeon hole principle , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[15] Pasin Manurangsi,et al. Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph , 2016, STOC.
[16] Moses Charikar,et al. On Approximating Target Set Selection , 2016, APPROX-RANDOM.
[17] Aditya Bhaskara,et al. Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph , 2011, SODA.
[18] Yuan Zhou,et al. Approximation Algorithms and Hardness of the k-Route Cut Problem , 2011, TALG.
[19] Omri Weinstein,et al. ETH Hardness for Densest-k-Subgraph with Perfect Completeness , 2015, SODA.
[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] Mohammad Taghi Hajiaghayi,et al. The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema , 2006, SODA '06.
[22] Pravesh Kothari,et al. A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[23] Alexander Russell,et al. Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping , 2006, International Conference on Computational Science.
[24] Mohammad Taghi Hajiaghayi,et al. Improved Approximation Algorithms for Label Cover Problems , 2011, Algorithmica.
[25] Euiwoong Lee,et al. Partitioning a graph into small pieces with applications to path transversal , 2016, Mathematical Programming.
[26] Van H. Vu,et al. Concentration of Multivariate Polynomials and Its Applications , 2000, Comb..
[27] Andrea Montanari,et al. Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems , 2015, COLT.
[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] Sanjeev Arora,et al. Inapproximabilty of Densest κ-Subgraph from Average Case Hardness , 2011 .
[30] Michael Dinitz,et al. Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion , 2016, SODA.
[31] Avi Wigderson,et al. Sum-of-squares Lower Bounds for Planted Clique , 2015, STOC.
[32] Uriel Feige,et al. The Ordered Covering Problem , 2017, Algorithmica.
[33] Sanjeev Arora,et al. Computational complexity and information asymmetry in financial products , 2011, Commun. ACM.