Approximation algorithms for the submodular hitting set problem

DOI10.61091/jcmcc120-16MaRDI QIDQ6586591zbMATH OpenFDO

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)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

approximation algorithmroundingprimal-dualhitting setsubmodular

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cites work

• scientific article; zbMATH DE number 3904328 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• A note on submodular function minimization with covering type linear constraints
• Discrete Convex Analysis
• Greedy approximations for minimum submodular cover with submodular cost
• Improved approximation algorithms for the facility location problems with linear/submodular penalties
• Submodular Function Minimization under Covering Constraints
• Submodular functions and optimization.

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)