An evolutionary algorithm EASC achieves a constant bicriteria approximation for Minimum Cost Submodular Cover in expected polynomial time, matching greedy's guarantee while showing practical speedups.
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
-
An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover
An evolutionary algorithm EASC achieves a constant bicriteria approximation for Minimum Cost Submodular Cover in expected polynomial time, matching greedy's guarantee while showing practical speedups.