Vertex Cover Problem Parameterized Above and Below Tight Bounds

Abstract. We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman and Sikdar, J. Computer and System Sciences, 75(2):137–153, 2009) are fixed-parameter tractable and two other parameterizations are W[1]-hard (one of them is, in fact, W[2]-hard).

• Type: Journal
• Year: 2011
• Where: MST
• Authors: Gregory Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
• Keywords: Hardware, MST 2011, System Sciences, Tight Bounds, Well-known Vertex Cover