On minimum submodular cover with submodular cost
From MaRDI portal
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
- The minimum entropy submodular set cover problem
- On submodular function minimization
- Approximation algorithms for the minimum power cover problem with submodular/linear penalties
Cites work
- scientific article; zbMATH DE number 5764849 (Why is no real title available?)
- An analysis of the greedy algorithm for the submodular set covering problem
- Efficient distributed algorithms for topology control problem with shortest path constraints
- Greedy approximations for minimum submodular cover with submodular cost
Cited in
(9)- 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
- Submodular function minimization under a submodular set covering constraint
- 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 cross-monotonic cost-sharing scheme for the concave facility location game
- Minimization problems with non-submodular cover constraint
- A PTAS for weak minimum routing cost connected dominating set of unit disk graph
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)
