Approximation algorithms for the submodular hitting set problem
From MaRDI portal
Publication:6586591
DOI10.61091/jcmcc120-16MaRDI QIDQ6586591FDOQ6586591
Authors: Shaojing Du, Bo Hou, Wen Liu 
Publication date: 13 August 2024
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Cites Work
- Discrete Convex Analysis
- Submodular functions and optimization.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Submodular Function Minimization under Covering Constraints
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
- Greedy approximations for minimum submodular cover with submodular cost
- A note on submodular function minimization with covering type linear constraints
This page was built for publication: Approximation algorithms for the submodular hitting set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586591)
