Crown reductions for the Minimum Weighted Vertex Cover problem

The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG'03), Lecture notes in computer science, vol. 2880, 2003, pp. 1

• Type: Journal
• Year: 2008
• Where: DAM
• Authors: Miroslav Chlebík, Janka Chlebíková
• Keywords: DAM 2008, Minimum Vertex, Reductions, Vertex Cover Problems