%0 Journal Article
%T Improved Parameterized Algorithm for P2-Packing Problem<br>P2-Packing问题参数算法的改进
%A WANG Jian-Xin
%A NING Dan
%A FENG Qi-Long
%A CHEN Jian-Er
%A <br>王建新
%A 宁 丹
%A 冯启龙
%A 陈建二
%J 软件学报
%D 2008
%I 
%X 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).
%K P2-packing
%K kernelization
%K parameterized algorithm<br>P2-packing
%K 核心化
%K 参数算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=6DB4EDB2F23BCE254804D43CEA73085E&yid=67289AFF6305E306&vid=2A8D03AD8076A2E3&iid=708DD6B15D2464E8&sid=056F689C0D4C15AF&eid=C9E0DE3ED09CB64F&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=8