Improved Parameterized Algorithm for P2-Packing Problem
P2-Packing问题参数算法的改进

P2-Packing is a typical NP-hard problem. This paper provides a further study on the structures of the P2-packing problem, and proposes a kernelization algorithm that can obtain a kernel of size at most 7k, which greatly reduces the current best kernel 15k. Based on the kernelization algorithm, an improved parameterized algorithm with running time O*(24.142k) is also presented, which greatly improves the current best result O*(25.301k).