arXiv Open Access 2013

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

Songjian Lu Xinghua Lu

Lihat Sumber

Abstrak

In this paper, we will introduce an exact algorithm with a time complexity of $O^*(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.

Topik & Kata Kunci

cs.DS

Penulis (2)

Songjian Lu

Xinghua Lu

Format Sitasi

APA MLA BibTeX

Lu, S., Lu, X. (2013). An exact algorithm with the time complexity of $O^*(1.299^m)$ for the weighed mutually exclusive set cover problem. https://arxiv.org/abs/1302.5820

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓