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-hard (one of them is, in fact, W-hard).
DOI identifier: 10.1007/s00224-010-9262-y
Sorry, we are unable to provide the full text but you may find it at the