On approximating projection games
暂无分享,去创建一个
[1] Philip N. Klein,et al. A linear-time approximation scheme for planar weighted TSP , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[2] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[3] Carsten Lund,et al. Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[4] Refael Hassin,et al. Complexity of finding dense subgraphs , 2002, Discret. Appl. Math..
[5] Uriel Feige,et al. Resolution lower bounds for the weak pigeon hole principle , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[6] Russell Impagliazzo,et al. AM with Multiple Merlins , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[7] Pasin Manurangsi,et al. Improved Approximation Algorithms for Projection Games , 2015, Algorithmica.
[8] Michael Langberg,et al. Approximation Algorithms for Maximization Problems Arising in Graph Partitioning , 2001, J. Algorithms.
[9] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[10] Madhur Tulsiani. CSP gaps and reductions in the lasserre hierarchy , 2009, STOC '09.
[11] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[12] Jean B. Lasserre,et al. An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs , 2001, IPCO.
[13] Ge Xia,et al. Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..
[14] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[15] Dana Moshkovitz. The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover , 2015, Theory Comput..
[16] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[17] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[18] Aditya Bhaskara,et al. Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.
[19] David Peleg. Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems , 2007, J. Discrete Algorithms.
[20] Aditya Bhaskara,et al. Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph , 2011, SODA.
[21] Nisheeth K. Vishnoi,et al. Unique games on expanding constraint graphs are easy: extended abstract , 2008, STOC '08.
[22] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[23] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[24] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[25] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .
[26] Noga Alon,et al. Random sampling and approximation of MAX-CSPs , 2003, J. Comput. Syst. Sci..
[27] Carsten Lund,et al. On the hardness of approximating minimization problems , 1993, STOC.
[28] Prasad Raghavendra,et al. Rounding Semidefinite Programming Hierarchies via Global Correlation , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[29] Ran Raz,et al. Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner , 2012, ICALP.
[30] Uriel Feige,et al. The Dense k -Subgraph Problem , 2001, Algorithmica.
[31] Jean B. Lasserre,et al. Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..
[32] Mohammad Taghi Hajiaghayi,et al. Improved Approximation Algorithms for Label Cover Problems , 2011, Algorithmica.
[33] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[34] Dániel Marx,et al. A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals , 2012, ICALP.
[35] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[36] David Steurer,et al. Subsampling mathematical relaxations and average-case complexity , 2009, SODA '11.
[37] Prasad Raghavendra,et al. Graph expansion and the unique games conjecture , 2010, STOC '10.
[38] T. Rothvoss. The Lasserre hierarchy in Approximation algorithms Lecture Notes for the MAPSP 2013 Tutorial Preliminary version , 2013 .
[39] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[40] Anand Srivastav,et al. Finding Dense Subgraphs with Semidefinite Programming , 1998, APPROX.
[41] Dániel Marx,et al. On the Optimality of Planar and Geometric Approximation Schemes , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[42] David Eppstein. Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.
[43] Pasin Manurangsi,et al. Improved Approximation Algorithms for Projection Games - (Extended Abstract) , 2013, ESA.
[44] Monique Laurent,et al. A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2001, Math. Oper. Res..
[45] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..
[46] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[47] Subhash Khot. Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique , 2004, FOCS.
[48] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[49] Ran Raz,et al. Two Query PCP with Sub-Constant Error , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[50] Sanjeev Arora,et al. Inapproximabilty of Densest κ-Subgraph from Average Case Hardness , 2011 .