16 citations · 23 across the 12 of their papers we have counts for
Showing 2019 · cs.DSShow all
3 papers · 2 filters
cs.DS2019
An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover
Victoria G. Crawford
In this paper, the Minimum Cost Submodular Cover problem is studied, which is to minimize a modular cost function such that the monotone submodular benefit function is above a thre…
cs.DS2019
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions
Victoria G. Crawford
In this paper, the monotone submodular maximization problem (SM) is studied. SM is to find a subset of size from a universe of size that maximizes a monotone submodular obj…
cs.DS2019★ 5 cited
Submodular Cost Submodular Cover with an Approximate Oracle
Victoria G. Crawford, Alan Kuhnle, My T. Thai
In this work, we study the Submodular Cost Submodular Cover problem, which is to minimize the submodular cost required to ensure that the submodular benefit function exceeds a give…