Change search
ReferencesLink to record
Permanent link

Direct link
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
Abstract [en]

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[1]-hard (one of them is, in fact, W[2]-hard).

Place, publisher, year, edition, pages
2011. Vol. 48, no 2, 402-410 p.
Keyword [en]
Parameterized algorithms, Parameterized complexity, Vertex cover
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-58601DOI: 10.1007/s00224-010-9262-yISI: 000286388100008OAI: diva2:473409
QC 20120125Available from: 2012-01-05 Created: 2012-01-05 Last updated: 2012-01-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Lampis, Michael
In the same journal
Theory of Computing Systems
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 14 hits
ReferencesLink to record
Permanent link

Direct link