Fast, effective vertex cover kernelization: a tale of two algorithms

Summary form only given. Two kernelization methods for the vertex cover problem are investigated. The first, LP-kernelization has been in prior use and is known to produce predictable results. The second, crown reduction, is newer and faster but generates more variable results. Previously-unknown connections between these powerful methods are established. It is also shown that the problem of finding an induced crown-free subgraph in an arbitrary graph is decidable in polynomial time. Applications of crown structures are discussed.

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

[2]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

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

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

[5]  D. Bienstock,et al.  Algorithmic Implications of the Graph Minor Theorem , 1995 .

[6]  Samir Khuller.  The vertex cover problem , 2002 .

[7]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[8]  Michael R. Fellows,et al.  Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps , 2004, WG.

[9]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

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

[11]  Hans Jürgen Schneider,et al.  Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science , 1987 .

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

[13]  Faisal N. Abu-Khzam,et al.  Scalable Parallel Algorithms for FPT Problems , 2006, Algorithmica.

[14]  Michael R. Fellows,et al.  Nonconstructive tools for proving polynomial-time decidability , 1988, JACM.

[15]  D. Bienstock,et al.  Chapter 8 Algorithmic implications of the graph minor theorem , 1995 .