An improved fixed parameter tractable algorithm for vertex cover

Given a graph G V E Vertex Cover asks for a smallest subset V V such that for each edge a b in G a V or b V We present an improved xed parameter tractable algorithm when the problem is parameterized by the size k of V The algorithm has a complexity of O kn maxf k k kg We improve the klam value by to k

[1]  Michael R. Fellows,et al.  Nonconstructive Advances in Polynomial-Time Complexity , 1987, Inf. Process. Lett..

[2]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[3]  Mihalis Yannakakis,et al.  On limited nondeterminism and the complexity of the V-C dimension , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[4]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[5]  Michael R. Fellows,et al.  Parameterized complexity: A framework for systematically confronting computational intractability , 1997, Contemporary Trends in Discrete Mathematics.

[6]  Michael R. Fellows,et al.  An Improved Fixed-Parameter Algorithm for Vertex Cover , 1998, Inf. Process. Lett..

[7]  R. Niedermeier,et al.  Upper Bounds for Vertex Cover Further Improved , 1999, STACS.

[8]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .