An exact algorithm for the weighed mutually exclusive maximum set cover problem

Songjian Lu, Xinghua Lu

In this paper, we introduce an exact algorithm with a time complexity of $O^{\ast }(1.325^m)$ for the {\sc weighted mutually exclusive maximum set cover} problem, where $m$ is the number…