Vertex Cover Problem Parameterized Above and Below Tight Bounds

Authors:
Gregory Gutin;Eun Jung Kim;Michael Lampis;Valia Mitsou
Affiliations:
University of London, Royal Holloway, TW20 0EX, Egham, Surrey, UK;University of London, Royal Holloway, TW20 0EX, Egham, Surrey, UK;City University of New York, Department of Computer Science, New York, USA;City University of New York, Department of Computer Science, New York, USA
Venue:
Theory of Computing Systems
Year:
2011

Citing 0
Cited 8

Note on maximal bisection above tight lower bound

Information Processing Letters
All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems

Theoretical Computer Science
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Journal of Computer and System Sciences
Generalized above guarantee vertex cover and r-partization

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
On multiway cut parameterized above lower bounds

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics
On multiway cut parameterized above lower bounds

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.00

Visualization

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