Approximation algorithms for the submodular hitting set problem

DOI10.61091/jcmcc120-16MaRDI QIDQ6586591FDOQ6586591

Wen Liu, Shaojing Du, Bo Hou

Publication date: 13 August 2024

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmroundingprimal-dualhitting setsubmodular

Mathematics Subject Classification ID

Approximation algorithms (68W25)

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)