Title of article :
Kernelization in Parameterized Computation: A Survey
Author/Authors :
Feng, Qilong Central South University - School of Information Science and Engineering, China , Zhou, Qian Central South University - School of Information Science and Engineering, China , Li, Wenjun Central South University - School of Information Science and Engineering, China , Wang, Jianxin Central South University - School of Information Science and Engineering, China
Abstract :
Parameterized computation is a new method dealing with NP-hard problems, which has attracted a lot of attentions in theoretical computer science. As a practical preprocessing method for NP-hard problems, kernelizaiton in parameterized computation has recently become an active research area. In this paper, we discuss several kernelizaiton techniques, such as crown decomposition, planar graph vertex partition, randomized methods, and kernel lower bounds, which have been used widely in the kernelization of many hard problems.
Keywords :
parameterized computation , kernelization , parameterized algorithm , NP , hard
Journal title :
Tsinghua Science and Technology
Journal title :
Tsinghua Science and Technology
