Vertex Cover Problem Parameterized Above and Below Tight Bounds
2011 (English)In: Theory of Computing Systems, ISSN 1432-4350, E-ISSN 1433-0490, Vol. 48, no 2, 402-410 p.Article in journal (Refereed) Published
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 et al. in J. Comput. Syst. Sci. 75(2):137-153, 2009) are fixed-parameter tractable and two other parameterizations are W-hard (one of them is, in fact, W-hard).
Place, publisher, year, edition, pages
2011. Vol. 48, no 2, 402-410 p.
Parameterized algorithms, Parameterized complexity, Vertex cover
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-58601DOI: 10.1007/s00224-010-9262-yISI: 000286388100008OAI: oai:DiVA.org:kth-58601DiVA: diva2:473409
QC 201201252012-01-052012-01-052012-01-25Bibliographically approved