On parameterized exponential time complexity
暂无分享,去创建一个
[1] Ge Xia,et al. Improved Parameterized Upper Bounds for Vertex Cover , 2006, MFCS.
[2] Weijia Jia,et al. Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.
[3] Michael R. Fellows,et al. Parameterized complexity: A framework for systematically confronting computational intractability , 1997, Contemporary Trends in Discrete Mathematics.
[4] Ge Xia,et al. Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, SIAM J. Comput..
[5] Ge Xia,et al. Linear FPT reductions and computational lower bounds , 2004, STOC '04.
[6] Rolf Niedermeier,et al. On efficient fixed-parameter algorithms for weighted vertex cover , 2003, J. Algorithms.
[7] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.
[8] Judy Goldsmith,et al. Nondeterminism Within P , 1993, SIAM J. Comput..
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Ljubomir Perkovic,et al. Improved Parameterized Algorithms for Planar Dominating Set , 2002, MFCS.
[11] Meena Mahajan,et al. Parametrizing Above Guaranteed Values: MaxSat and MaxCut , 1997, Electron. Colloquium Comput. Complex..
[12] Fabrizio Grandoni,et al. Refined memorization for vertex cover , 2005, Inf. Process. Lett..
[13] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[14] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[15] Michael R. Fellows,et al. An Improved Fixed-Parameter Algorithm for Vertex Cover , 1998, Inf. Process. Lett..
[16] Ge Xia,et al. Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[17] Rolf Niedermeier,et al. Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.
[18] David S. Johnson,et al. What are the least tractable instances of max independent set? , 1999, SODA '99.
[19] Ge Xia,et al. Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..
[20] Rolf Niedermeier,et al. Upper Bounds for Vertex Cover Further Improved , 1999, STACS.
[21] Liming Cai,et al. On the existence of subexponential parameterized algorithms , 2003, J. Comput. Syst. Sci..
[22] Rolf Niedermeier,et al. Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case , 2002, SWAT.
[23] Reinhard Diestel,et al. Graph Theory , 1997 .
[24] Ge Xia,et al. On the computational hardness based on linear FPT-reductions , 2006, J. Comb. Optim..
[25] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[26] Dimitrios M. Thilikos,et al. Dominating sets in planar graphs: branch-width and exponential speed-up , 2003, SODA '03.
[27] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..