Vertex Cover Problem Parameterized Above and Below Tight Bounds
Computational Complexity
2009-08-28 v2 Data Structures and Algorithms
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).
Cite
@article{arxiv.0907.4488,
title = {Vertex Cover Problem Parameterized Above and Below Tight Bounds},
author = {Gregory Gutin and Eun Jung Kim and Michael Lampis and Valia Mitsou},
journal= {arXiv preprint arXiv:0907.4488},
year = {2009}
}