Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer.
Dorit S. HochbaumXu RaoPublished in: Inf. Process. Lett. (2020)
Keyphrases
- approximation algorithms
- special case
- np hard
- vertex cover
- worst case
- set cover
- breast cancer
- network design problem
- facility location problem
- approximation ratio
- minimum cost
- randomized algorithms
- np hardness
- primal dual
- integrality gap
- disjoint paths
- combinatorial auctions
- constant factor
- gene expression profiles
- open shop
- connected components
- polynomial time approximation
- gene selection
- approximation schemes
- undirected graph
- precedence constraints
- differential expression