A kernel of order 2k-clogk for vertex cover

Authors:
Michael Lampis
Affiliations:
Graduate Center, City University of New York, 365 5th Avenue, New York, NY, United States
Venue:
Information Processing Letters
Year:
2011

Citing 8
Cited 3

Vertex cover: further observations and further improvements

Journal of Algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Crown reductions for the Minimum Weighted Vertex Cover problem

Discrete Applied Mathematics
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size

SIAM Journal on Computing
Almost 2-SAT is fixed-parameter tractable

Journal of Computer and System Sciences
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses

Proceedings of the forty-second ACM symposium on Theory of computing
Fixed-parameter tractability of multicut parameterized by the size of the cutset

Proceedings of the forty-third annual ACM symposium on Theory of computing

Constraint satisfaction problems parameterized above or below tight bounds: a survey

The Multivariate Algorithmic Revolution and Beyond
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics
Solving min ones 2-sat as fast as vertex cover

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

In a recent paper Soleimanfallah and Yeo proposed a kernelization algorithm for vertex cover which, for any fixed constant c, produces a kernel of order 2k-c in polynomial time. In this paper we show how their techniques can be extended to improve the produced kernel to order 2k-clogk, for any fixed constant c.