Approximation algorithms on $k-$ cycle covering and $k-$ clique covering

Zhongzheng Tang, Zhuo Diao

Given a weighted graph $G(V,E)$ with weight $\mathbf{w}:E\to Z_{+}^{|E|}$. A $k-$cycle covering is an edge subset $A$ of $E$ such that $G-A$ has no $k-$cycle. The minimum w…