An exact algorithm with the time complexity of $O^*(1.299^m)$ for the weighed mutually exclusive set cover problem
Data Structures and Algorithms
2013-02-26 v1
Abstract
In this paper, we will introduce an exact algorithm with a time complexity of for the {\sc weighted mutually exclusive set cover} problem, where is the number of subsets in the problem. This problem has important applications in recognizing mutation genes that cause different cancer diseases.
Keywords
Cite
@article{arxiv.1302.5820,
title = {An exact algorithm with the time complexity of $O^*(1.299^m)$ for the weighed mutually exclusive set cover problem},
author = {Songjian Lu and Xinghua Lu},
journal= {arXiv preprint arXiv:1302.5820},
year = {2013}
}