Parameterized algorithms for the max k-set cover and related satisfiability problems
暂无分享,去创建一个
[1] Michael R. Fellows,et al. Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover , 2004, IWPEC.
[2] Michael R. Fellows,et al. Parameterized Approximation Problems , 2006, IWPEC.
[3] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[4] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[5] Liming Cai,et al. Fixed-Parameter Approximation: Conceptual Framework and Approximability Results , 2010, Algorithmica.
[6] Andreas Björklund,et al. Set Partitioning via Inclusion-Exclusion , 2009, SIAM J. Comput..
[7] Marco Cesati,et al. Compendium of Parameterized Problems , 2006 .
[8] Michael R. Fellows,et al. Parameterized approximation of dominating set problems , 2008, Inf. Process. Lett..
[9] Dániel Marx,et al. Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..
[10] Reuven Bar-Yehuda,et al. On approximation problems related to the independent set and vertex cover problems , 1984, Discret. Appl. Math..
[11] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[12] Gerhard J. Woeginger,et al. Exact (Exponential) Algorithms for the Dominating Set Problem , 2004, WG.
[13] Marco Cesati,et al. The Turing way to parameterized complexity , 2003, J. Comput. Syst. Sci..
[14] Leizhen Cai,et al. Parameterized Complexity of Cardinality Constrained Optimization Problems , 2008, Comput. J..
[15] Leizhen Cai,et al. Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems , 2006, IWPEC.
[16] Markus Bläser,et al. Computing small partial coverings , 2003, Inf. Process. Lett..
[17] Weijia Jia,et al. Using Nondeterminism to Design Deterministic Algorithms , 2001, FSTTCS.
[18] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .
[19] Yijia Chen,et al. On Parameterized Approximability , 2006, IWPEC.
[20] Vangelis Th. Paschos,et al. Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization , 2013, IPEC.
[21] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[22] 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.
[23] Jörg Flum,et al. W-Hierarchies Defined by Symmetric Gates , 2008, Theory of Computing Systems.
[24] Jianer Chen,et al. Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms , 2006, IWPEC.
[25] Dimitrios M. Thilikos,et al. Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..
[26] Sven Koenig,et al. Greedy localization , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).