The greedy algorithm for Submodular Cost Submodular Cover is shown to achieve new bicriteria approximation ratios when the benefit function is only accessible through an ϵ-approximate oracle, provided the smallest marginal gain exceeds a threshold.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Submodular Cost Submodular Cover with an Approximate Oracle
The greedy algorithm for Submodular Cost Submodular Cover is shown to achieve new bicriteria approximation ratios when the benefit function is only accessible through an ϵ-approximate oracle, provided the smallest marginal gain exceeds a threshold.