Approximating Dense Max 2-CSPs
暂无分享,去创建一个
[1] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[2] Uriel Feige,et al. The Dense k -Subgraph Problem , 2001, Algorithmica.
[3] Mark Braverman,et al. Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis , 2015, Electron. Colloquium Comput. Complex..
[4] Mohammad Taghi Hajiaghayi,et al. Improved Approximation Algorithms for Label Cover Problems , 2011, Algorithmica.
[5] Marek Karpinski,et al. Polynomial time approximation schemes for dense instances of NP-hard problems , 1995, STOC '95.
[6] Takeshi Tokuyama,et al. Dense Subgraph Problems with Output-Density Conditions , 2005, ISAAC.
[7] Aditya Bhaskara,et al. Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.
[8] David Steurer,et al. Subsampling mathematical relaxations and average-case complexity , 2009, SODA '11.
[9] Russell Impagliazzo,et al. AM with Multiple Merlins , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[10] Ran Raz,et al. Strong Parallel Repetition Theorem for Free Projection Games , 2009, APPROX-RANDOM.
[11] Aram Wettroth Harrow,et al. Quantum de Finetti Theorems Under Local Measurements with Applications , 2012, STOC '13.
[12] Noga Alon,et al. Random sampling and approximation of MAX-CSPs , 2003, J. Comput. Syst. Sci..
[13] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[14] Dana Moshkovitz,et al. The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover , 2012, Theory Comput..
[15] Pasin Manurangsi,et al. Improved Approximation Algorithms for Projection Games , 2015, Algorithmica.
[16] Takeshi Tokuyama,et al. Dense subgraph problems with output-density conditions , 2005, TALG.
[17] 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.
[18] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..