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

TL;DR

This paper presents approximation algorithms for the minimum weighted $k$-cycle and $k$-clique covering problems in graphs, providing bounds and exploring their relationship with packing problems.

Contribution

It introduces a $k-1/2$ approximation for $k$-cycle covering when $k$ is odd and a $(k^{2}-k-1)/2$ approximation for $k$-clique covering, advancing algorithmic solutions for these problems.

Findings

Developed a $k-1/2$ approximation algorithm for odd $k$-cycle covering.

Created a $(k^{2}-k-1)/2$ approximation algorithm for $k$-clique covering.

Analyzed the relationship between $k$-clique covering and packing in complete graphs.

Abstract

Given a weighted graph $G(V,E)$ with weight $\mathbf w: E\rightarrow Z^{|E|}_{+}$. A $k-$cycle covering is an edge subset $A$ of $E$ such that $G-A$ has no $k-$cycle. The minimum weight of $k-$cycle covering is the weighted covering number on $k-$cycle, denoted by $\tau_{k}(G_{w})$. In this paper, we design a $k-1/2$ approximation algorithm for the weighted covering number on $k-$cycle when $k$ is odd. Given a weighted graph $G(V,E)$ with weight $\mathbf w: E\rightarrow Z^{|E|}_{+}$. A $k-$clique covering is an edge subset $A$ of $E$ such that $G-A$ has no $k-$clique. The minimum weight of $k-$clique covering is the weighted covering number on $k-$clique, denoted by $\widetilde{\tau_{k}}(G_{w})$. In this paper, we design a $(k^{2}-k-1)/2$ approximation algorithm for the weighted covering number on $k-$clique. Last, we discuss the relationship between $k-$clique covering and $k-$clique packing in complete graph $K_{n}$.