From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
暂无分享,去创建一个
Luca Trevisan | Guy Kortsarz | Pasin Manurangsi | Marek Cygan | Danupon Nanongkai | Parinya Chalermsook | Bundit Laekhanukit | L. Trevisan | G. Kortsarz | Pasin Manurangsi | Danupon Nanongkai | Marek Cygan | Parinya Chalermsook | Bundit Laekhanukit
[1] Vijay V. Vazirani,et al. NP-Completeness of Some Generalizations of the Maximum Matching Problem , 1982, Inf. Process. Lett..
[2] David Zuckerman,et al. On Unapproximable Versions of NP-Complete Problems , 1996, SIAM J. Comput..
[3] Pasin Manurangsi,et al. On the parameterized complexity of approximating dominating set , 2017, Electron. Colloquium Comput. Complex..
[4] Mohammad Taghi Hajiaghayi,et al. Improved Approximation Algorithms for Label Cover Problems , 2011, Algorithmica.
[5] Hannes Moser,et al. The parameterized complexity of the induced matching problem , 2009, Discret. Appl. Math..
[6] Guy Kortsarz,et al. Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT , 2013, 1310.2711.
[7] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[8] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[9] David P. Williamson,et al. The Design of Approximation Algorithms , 2011 .
[10] Carsten Lund,et al. The Approximation of Maximum Subgraph Problems , 1993, ICALP.
[11] Ryan O'Donnell,et al. How to Refute a Random CSP , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[12] Salil P. Vadhan,et al. Pseudorandomness , 2012, Found. Trends Theor. Comput. Sci..
[13] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[14] Dima Grigoriev,et al. Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity , 2001, Theor. Comput. Sci..
[15] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[16] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[17] Dániel Marx,et al. Data Reduction and Problem Kernels (Dagstuhl Seminar 12241) , 2012, Dagstuhl Reports.
[18] Ge Xia,et al. Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..
[19] Rajiv Gandhi,et al. Bicovering: Covering edges with two small subsets of vertices , 2016, Electron. Colloquium Comput. Complex..
[20] Lars Engebretsen,et al. Clique Is Hard To Approximate Within , 2000 .
[21] Khaled M. Elbassioni,et al. On the approximability of the maximum feasible subsystem problem with 0/1-coefficients , 2009, SODA.
[22] Mihai Patrascu,et al. On the possibility of faster SAT algorithms , 2010, SODA '10.
[23] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[24] Ge Xia,et al. Linear FPT reductions and computational lower bounds , 2004, STOC '04.
[25] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[26] Benny Applebaum,et al. Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[27] Uriel Feige,et al. Two-Prover Protocols - Low Error at Affordable Rates , 2000, SIAM J. Comput..
[28] Dániel Marx,et al. Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..
[29] Dana Moshkovitz,et al. The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover , 2012, Theory Comput..
[30] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[31] Irit Dinur,et al. On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors , 2010, APPROX-RANDOM.
[32] Pasin Manurangsi,et al. Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph , 2016, STOC.
[33] Uriel Feige,et al. Approximating Maximum Clique by Removing Subgraphs , 2005, SIAM J. Discret. Math..
[34] Sanjeev Arora,et al. Inapproximabilty of Densest κ-Subgraph from Average Case Hardness , 2011 .
[35] Vangelis Th. Paschos,et al. Time-Approximation Trade-offs for Inapproximable Problems , 2016, STACS.
[36] Danupon Nanongkai,et al. Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More , 2013, SODA.
[37] Guy Kortsarz,et al. On Choosing a Dense Subgraph (Extended Abstract) , 1993, FOCS 1993.
[38] Aditya Bhaskara,et al. Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph , 2011, SODA.
[39] Vangelis Th. Paschos,et al. On Subexponential and FPT-Time Inapproximability , 2013, Algorithmica.
[40] Prasad Raghavendra,et al. Lower Bounds on the Size of Semidefinite Programming Relaxations , 2014, STOC.
[41] Bingkai Lin,et al. The Parameterized Complexity of k-Biclique , 2014, SODA.
[42] Yijia Chen,et al. On Parameterized Approximability , 2006, IWPEC.
[43] David Zuckerman. Simulating BPP using a general weak random source , 2005, Algorithmica.
[44] David Manlove,et al. On the approximability of the maximum induced matching problem , 2005, J. Discrete Algorithms.
[45] 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.
[46] Magnús M. Halldórsson,et al. Journal of Graph Algorithms and Applications Approximations of Weighted Independent Set and Hereditary Subset Problems , 2022 .
[47] Ge Xia,et al. On the computational hardness based on linear FPT-reductions , 2006, J. Comb. Optim..
[48] Mihir Bellare,et al. Improved non-approximability results , 1994, STOC '94.
[49] Omri Weinstein,et al. ETH Hardness for Densest-k-Subgraph with Perfect Completeness , 2015, SODA.
[50] Piotr Berman,et al. On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..
[51] Richard Ryan Williams,et al. Distributed PCP Theorems for Hardness of Approximation in P , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[52] Venkatesh Raman,et al. Parameterized complexity of finding subgraphs with hereditary properties , 2000, Theor. Comput. Sci..
[53] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[54] Aravindan Vijayaraghavan,et al. Approximation Algorithms for Label Cover and The Log-Density Threshold , 2017, SODA.
[55] Aditya Bhaskara,et al. Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.
[56] Grant Schoenebeck,et al. Linear Level Lasserre Lower Bounds for Certain k-CSPs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[57] Michael R. Fellows,et al. Parameterized approximation of dominating set problems , 2008, Inf. Process. Lett..
[58] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[59] Shimon Kogan,et al. The Hardness of Approximating Hereditary Properties , 2005 .
[60] Jonas Holmerin,et al. Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.
[61] John M. Lewis,et al. The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..
[62] Subhash Khot,et al. On Hardness of Approximating the Parameterized Clique Problem , 2016, Electron. Colloquium Comput. Complex..
[63] Subhash Khot,et al. Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[64] Angelika Steger,et al. On induced matchings , 1993, Discret. Math..
[65] Uriel Feige,et al. Resolution lower bounds for the weak pigeon hole principle , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[66] J. Håstad. Clique is hard to approximate within n 1-C , 1996 .
[67] Russell Impagliazzo,et al. AM with Multiple Merlins , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[68] Pasin Manurangsi,et al. Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis , 2017, ICALP.
[69] Vangelis Th. Paschos,et al. Time-approximation trade-offs for inapproximable problems , 2015, J. Comput. Syst. Sci..
[70] Danupon Nanongkai,et al. Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[71] Irit Dinur,et al. Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover , 2016, Electron. Colloquium Comput. Complex..
[72] Prasad Raghavendra,et al. A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs , 2016, ICALP.
[73] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[74] Subhash Khot,et al. Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion , 2006, ICALP.
[75] Pasin Manurangsi,et al. On approximating projection games , 2015 .
[76] Mohammad Taghi Hajiaghayi,et al. Fixed-Parameter and Approximation Algorithms: A New Look , 2013, IPEC.
[77] V. Sós,et al. On a problem of K. Zarankiewicz , 1954 .
[78] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[79] Dániel Marx. Completely Inapproximable Monotone and Antimonotone Parameterized Problems , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.
[80] Prasad Raghavendra,et al. Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.
[81] Yijia Chen,et al. The Constant Inapproximability of the Parameterized Dominating Set Problem , 2015, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[82] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[83] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[84] Uriel Feige,et al. The Dense k -Subgraph Problem , 2001, Algorithmica.
[85] Russell Impagliazzo,et al. On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..
[86] Martin Grohe,et al. Parameterized Approximability of the Disjoint Cycle Problem , 2007, ICALP.
[87] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .