Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer

DOI10.1016/j.ipl.2020.105940zbMath1432.68575OpenAlexW3007268909MaRDI QIDQ2308460

Xu Rao, Dorit S. Hochbaum

Publication date: 3 April 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2020.105940

zbMATH Keywords

approximation algorithmsbounded radius subgraphconnected maximum coverage

Mathematics Subject Classification ID

Applications of graph theory (05C90) Medical applications (general) (92C50) Approximation algorithms (68W25)

Uses Software

• HotNet

Cites Work

• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• Unnamed Item