On minimum submodular cover with submodular cost
From MaRDI portal
Publication:540698
DOI10.1007/S10898-010-9563-3zbMATH Open1219.90138OpenAlexW2059655733MaRDI QIDQ540698FDOQ540698
Wonjun Lee, Du Ding-Zhu, Hongjie Du, Weili Wu, Zhao Zhang, Qinghai Liu
Publication date: 3 June 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9563-3
Cites Work
Cited In (8)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint
- PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
- A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
- Minimum non-submodular cover problem with applications
- Greedy approximations for minimum submodular cover with submodular cost
- A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph
- A cross-monotonic cost-sharing scheme for the concave facility location game
Recommendations
- Greedy approximations for minimum submodular cover with submodular cost π π
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem π π
- Minimum non-submodular cover problem with applications π π
- On approximation of the submodular set cover problem π π
- Submodular Function Minimization under a Submodular Set Covering Constraint π π
- Minimum Latency Submodular Cover π π
- Minimum Latency Submodular Cover π π
- The Minimum Entropy Submodular Set Cover Problem π π
- On submodular function minimization π π
- Approximation algorithms for the minimum power cover problem with submodular/linear penalties π π
This page was built for publication: On minimum submodular cover with submodular cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540698)