论文信息 - A 2k-kernelization algorithm for vertex cover based on crown decomposition

A 2k-kernelization algorithm for vertex cover based on crown decomposition

Abstract We revisit crown decomposition for the Vertex Cover problem by giving a simple 2 k -kernelization algorithm. Previously, a 2 k kernel was known but it was computed using both crown decomposition and linear programming; moreover, with crown decomposition alone only a 3 k kernel was known. Our refined crown decomposition carries some extra property and could be used for some other related problems.

Wen J. Li | Binhai Zhu | Wen J. Li | B. Zhu

[1] Samir Khuller,et al. Algorithms column: the vertex cover problem , 2002, SIGA.

[2] Faisal N. Abu-Khzam,et al. An improved kernelization algorithm for r-Set Packing , 2010, Inf. Process. Lett..

[3] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[4] Jianer Chen,et al. An improved kernelization for P2-packing , 2010, Inf. Process. Lett..

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Yongjie Yang. Towards optimal kernel for edge-disjoint triangle packing , 2014, Inf. Process. Lett..

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

[8] Ge Xia,et al. Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..

[9] Michael R. Fellows,et al. Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT , 2003, WG.

[10] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[11] Michael R. Fellows,et al. Crown Structures for Vertex Cover Kernelization , 2007, Theory of Computing Systems.

[12] Faisal N. Abu-Khzam,et al. A kernelization algorithm for d-Hitting Set , 2010, J. Comput. Syst. Sci..