Login / Signup
An exact algorithm with the time complexity of $O^*(1.299^m)$ for the weighed mutually exclusive set cover problem
Songjian Lu
Xinghua Lu
Published in:
CoRR (2013)
Keyphrases
</>
set cover
greedy algorithm
np hard
approximation algorithms
greedy heuristics
worst case
solution space
network flow
greedy heuristic
machine learning
computational complexity
column generation
denoising
mathematical model
integer programming
minimum cost