Parametric duality and kernelization: Lower bounds and upper bounds on kernel size

DSpace/Manakin Repository

LDR Home . . . Xia, Ge Publications of Ge Xia View Item

Parametric duality and kernelization: Lower bounds and upper bounds on kernel size

Show full item record


Title: Parametric duality and kernelization: Lower bounds and upper bounds on kernel size
Author: Kanj, I. A.; Fernau, H.; Chen, J.; Xia, Ge
Abstract: Determining whether a parameterized problem is kernelizable and has a small kernel size has recently become one of the most interesting topics of research in the area of parameterized complexity and algorithms. Theoretically, it has been proved that a parameterized problem is kernelizable if and only if it is fixed-parameter tractable. Practically, applying a data reduction algorithm to reduce an instance of a parameterized problem to an equivalent smaller instance (i.e., a kernel) has led to very efficient algorithms and now goes hand-in-hand with the design of practical algorithms for solving NP-hard problems. Well-known examples of such parameterized problems include the vertex cover problem, which is kernelizable to a kernel of size bounded by 2k, and the planar dominating set problem, which is kernelizable to a kernel of size bounded by 335k. In this paper we develop new techniques to derive upper and lower bounds on the kernel size for certain parameterized problems. In terms of our lower bound results, we show, for example, that unless P = NP, planar vertex cover does not have a problem kernel of size smaller than 4k/3, and planar independent set and planar dominating set do not have kernels of size smaller than 2k. In terms of our upper bound results, we further reduce the upper bound on the kernel size for the planar dominating set problem to 67k, improving significantly the 335k previous upper bound given by Alber, et al. This latter result is obtained by introducing a new set of reduction and coloring rules, which allows the derivation of nice combinatorial properties in the kernelized graph leading to a tighter bound on the size of the kernel. The paper also shows how this improved upper bound yields a simple and competitive algorithm for the planar dominating set problem.
URI: http://hdl.handle.net/10385/623
Date: 2007

Files in this item

Files Size Format View
Xia-SIAMJournalonComputing-2007-vol37-no4.pdf 345.1Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record

Search LDR


Advanced Search

Browse

My Account