Article thumbnail

Vertex Cover Problem Parameterized Above and Below Tight Bounds

By Gregory Gutin, Eun Jung Kim, Michael Lampis and Valia Mitsou

Abstract

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).

Year: 2010
DOI identifier: 10.1007/s00224-010-9262-y
OAI identifier: oai:CiteSeerX.psu:10.1.1.170.6651
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://web.cs.gc.cuny.edu/%7Em... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.