Improved upper bounds for vertex cover
暂无分享,去创建一个
Ge Xia | Jianer Chen | Iyad A. Kanj | Jianer Chen | Ge Xia
[1] Reinhard Diestel,et al. Graph Theory , 1997 .
[2] P. Hammer,et al. Pseudo-Boolean functions and stability of graphs , 1984 .
[3] Christian Sloper,et al. Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree , 2003, WADS.
[4] 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.
[5] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[6] Fabrizio Grandoni,et al. Measure and Conquer: Domination - A Case Study , 2005, ICALP.
[7] Rolf Niedermeier,et al. On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER , 2000, ISAAC.
[8] Peter Shaw,et al. Packing Edge Disjoint Triangles: A Parameterized View , 2004, IWPEC.
[9] Rolf Niedermeier,et al. A general method to speed up fixed-parameter-tractable algorithms , 2000, Inf. Process. Lett..
[10] Christian Sloper,et al. Looking at the Stars , 2004, IWPEC.
[11] Michael R. Fellows,et al. An Improved Fixed-Parameter Algorithm for Vertex Cover , 1998, Inf. Process. Lett..
[12] M. Fellows,et al. An improved fixed parameter tractable algorithm for vertex cover , 1999 .
[13] Michael R. Fellows,et al. Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps , 2004, WG.
[14] Liming Cai,et al. On the existence of subexponential parameterized algorithms , 2003, J. Comput. Syst. Sci..
[15] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[16] Michael R. Fellows,et al. Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.
[17] John Michael Robson,et al. Algorithms for Maximum Independent Sets , 1986, J. Algorithms.
[18] Weijia Jia,et al. Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.
[19] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..
[20] Michael R. Fellows,et al. Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT , 2003, WG.
[21] Ge Xia,et al. Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems , 2003, ISAAC.
[22] Rolf Niedermeier,et al. Upper Bounds for Vertex Cover Further Improved , 1999, STACS.
[23] Ulrike Stege,et al. Solving large FPT problems on coarse-grained parallel machines , 2003, J. Comput. Syst. Sci..
[24] Kousha Etessami,et al. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.
[25] Fabrizio Grandoni,et al. A measure & conquer approach for the analysis of exact algorithms , 2009, JACM.
[26] Gerhard J. Woeginger,et al. Open problems around exact algorithms , 2008, Discret. Appl. Math..
[27] Fabrizio Grandoni,et al. Refined Memorisation for Vertex Cover , 2004, IWPEC.
[28] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[29] Miroslav Chlebík,et al. Crown reductions for the Minimum Weighted Vertex Cover problem , 2008, Discret. Appl. Math..
[30] Fabrizio Grandoni,et al. Refined memorization for vertex cover , 2005, Inf. Process. Lett..
[31] Weijia Jia,et al. Improvement on vertex cover for low-degree graphs , 2000, Networks.
[32] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.
[33] Judy Goldsmith,et al. Nondeterminism Within P , 1993, SIAM J. Comput..
[34] David S. Johnson,et al. Cliques, Coloring, and Satisfiability , 1996 .
[35] Michael R. Fellows,et al. Finding k Disjoint Triangles in an Arbitrary Graph , 2004, WG.