An exact algorithm with the time complexity of $O^{\ast }(1.299^m)$ for the weighed mutually exclusive set cover problem

Abstract

In this paper, we will introduce an exact algorithm with a time complexity of $O^{\ast }(1.299^m)$ for the {\sc weighted mutually exclusive set cover} problem, where $m$ is the number of subsets in the problem. This problem has important applications in recognizing mutation genes that cause different cancer diseases.

References in corpus (1)

• Approximation Algorithms for Covering/Packing Integer Programs