On the parameterized complexity of approximating dominating set
暂无分享,去创建一个
Pasin Manurangsi | Bundit Laekhanukit | S. KarthikC. | Pasin Manurangsi | S. KarthikC. | Bundit Laekhanukit
[1] Alexander A. Razborov,et al. On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..
[2] Avi Wigderson,et al. Algebrization: A New Barrier in Complexity Theory , 2009, TOCT.
[3] Noga Alon,et al. Algorithmic construction of sets for k-restrictions , 2006, TALG.
[4] Michael R. Fellows,et al. Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..
[5] YannakakisMihalis,et al. On the hardness of approximating minimization problems , 1994 .
[6] Pasin Manurangsi,et al. On the Parameterized Complexity of Approximating Dominating Set , 2019, J. ACM.
[7] Uri Zwick,et al. Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity , 2016, SIROCCO.
[8] Bingkai Lin,et al. The Parameterized Complexity of k-Biclique , 2014, SODA.
[9] Michael R. Fellows,et al. Parameterized approximation of dominating set problems , 2008, Inf. Process. Lett..
[10] 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).
[11] Guy N. Rothblum,et al. Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets , 2017, ITCS.
[12] Aviad Rubinstein,et al. Hardness of approximate nearest neighbor search , 2018, STOC.
[13] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[14] Ge Xia,et al. Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..
[15] Qin Zhang,et al. Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy , 2011, SIAM J. Comput..
[16] Noga Alon,et al. Nearly complete graphs decomposable into large induced matchings and their applications , 2011, STOC '12.
[17] Prasad Raghavendra,et al. A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs , 2016, ICALP.
[18] Eli Ben-Sasson,et al. Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck , 2016, IACR Cryptol. ePrint Arch..
[19] Amir Abboud,et al. Exact Weight Subgraphs and the k-Sum Conjecture , 2013, ICALP.
[20] Mihai Patrascu,et al. On the possibility of faster SAT algorithms , 2010, SODA '10.
[21] Russell Impagliazzo,et al. Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[22] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[23] Craig A. Tovey,et al. A simplified NP-complete satisfiability problem , 1984, Discret. Appl. Math..
[24] Vangelis Th. Paschos,et al. On Subexponential and FPT-Time Inapproximability , 2013, Algorithmica.
[25] Liming Cai,et al. Fixed-Parameter Approximation: Conceptual Framework and Approximability Results , 2010, Algorithmica.
[26] David P. Woodruff,et al. The Simultaneous Communication of Disjointness with Applications to Data Streams , 2015, ICALP.
[27] Mohammad Taghi Hajiaghayi,et al. The Foundations of Fixed Parameter Inapproximability , 2013, ArXiv.
[28] 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).
[29] Zvi Galil,et al. Lower bounds on communication complexity , 1984, STOC '84.
[30] Bala Kalyanasundaram,et al. The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..
[31] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[32] Irit Dinur,et al. Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover , 2016, Electron. Colloquium Comput. Complex..
[33] H. Stichtenoth,et al. On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields , 1996 .
[34] Chrisil Arackaparambil,et al. Functional Monitoring without Monotonicity , 2009, ICALP.
[35] Mohammad Taghi Hajiaghayi,et al. Fixed-Parameter and Approximation Algorithms: A New Look , 2013, IPEC.
[36] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[37] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[38] Richard J. Lipton,et al. Multi-party protocols , 1983, STOC.
[39] Michael R. Fellows,et al. Parameterized Approximation Problems , 2006, IWPEC.
[40] H. Stichtenoth,et al. A low complexity algorithm for the construction of algebraic geometric codes better than the Gilbert-Varshamov bound , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[41] Michal Pilipczuk,et al. Parameterized Algorithms , 2015, Springer International Publishing.
[42] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[43] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[44] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[45] D. Spielman,et al. Expander codes , 1996 .
[46] Mihai Patrascu,et al. Towards polynomial lower bounds for dynamic problems , 2010, STOC '10.
[47] Satyanarayana V. Lokam,et al. Communication Complexity of Simultaneous Messages , 2003, SIAM J. Comput..
[48] GrandoniFabrizio,et al. On the complexity of fixed parameter clique and dominating set , 2004 .
[49] KoppartySwastik,et al. Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity , 2016 .
[50] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[51] Atri Rudra,et al. Topology Matters in Communication , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[52] Irit Dinur,et al. The PCP theorem by gap amplification , 2006, STOC.
[53] A. Razborov. Communication Complexity , 2011 .
[54] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[55] N. Nisan. The communication complexity of threshold gates , 1993 .
[56] Dana Moshkovitz,et al. The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover , 2012, Theory Comput..
[57] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .
[58] R. Downey,et al. Parameterized Computational Feasibility , 1995 .
[59] Peter Slavík. A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.
[60] Ryan Williams,et al. A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..
[61] Oded Goldreich,et al. Computational complexity: a conceptual perspective , 2008, SIGA.
[62] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[63] Mark H. Overmars,et al. On a Class of O(n2) Problems in Computational Geometry , 1995, Comput. Geom..
[64] Yijia Chen,et al. On Parameterized Approximability , 2006, IWPEC.
[65] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[66] Or Meir,et al. IP = PSPACE Using Error-Correcting Codes , 2013, SIAM J. Comput..
[67] Ryan Williams,et al. Losing Weight by Gaining Edges , 2013, ESA.
[68] Friedrich Eisenbrand,et al. On the complexity of fixed parameter clique and dominating set , 2004, Theor. Comput. Sci..
[69] Ran Raz,et al. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.
[70] Aravind Srinivasan,et al. Improved approximations of packing and covering problems , 1995, STOC '95.
[71] Nitin H. Vaidya,et al. Multiparty Equality Function Computation in Networks with Point-to-Point Links , 2011, SIROCCO.
[72] Luca Trevisan,et al. From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[73] Graham Cormode,et al. Algorithms for distributed functional monitoring , 2008, SODA '08.
[74] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[75] Guy N. Rothblum,et al. Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[76] Emanuele Viola,et al. The communication complexity of addition , 2013, Comb..
[77] Ziv Bar-Yossef,et al. An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[78] Moses Charikar,et al. On Approximating Target Set Selection , 2016, APPROX-RANDOM.