%A LUO Wei-dong, WANG Jian-xin and FENG Qi-long %T Survey of Cycle Packing Problem %0 Journal Article %D 2017 %J Computer Science %R 10.11896/j.issn.1002-137X.2017.01.001 %P 1-6 %V 44 %N 1 %U {https://www.jsjkx.com/CN/abstract/article_1042.shtml} %8 2018-11-13 %X Cycle packing problem was first presented by Erds and Pósa.Since then researchers have been studying the problem in graph theory and theoretical computer science.Recently,researchers find that the problem has improtant applications in computational biology,especially for reconstruction of evolutionary trees and genomic analysis.In this paper,an introduction to the research status of this problem was given.First and foremost,some results of cycle packing problem in graph theory were discussed.Then,we analyzed and discussed approximation algorithms,parameterized algorithms,parameterized complexity and inapproximability of the problem.At last,some further research directions on this problem were given.