We study the problem of maximizing a monotone submodular function subject to a
cardinality constraint $ k $, with the added twist that a number of items $\tau $ from the …

We study the classical problem of maximizing a monotone submodular function subject to a
cardinality constraint k, with two additional twists:(i) elements arrive in a streaming fashion …

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 …

In this paper, we consider the optimization problem Submodular Cover (SC), which is to find
a minimum cost subset of a ground set $ U $ such that the value of a submodular function $ f …

In this paper, we consider the optimization problem Submodular Cover (SCP), which is to
find a minimum cardinality subset of a finite universe $ U $ such that the value of a …

Artificial intelligence (AI) contributes new methods for designing compounds in drug
discovery, ranging from de novo design models suggesting new molecular structures or …

In this paper, we mainly investigate the optimization model that minimizes the cost function
such that the cover function exceeds a required threshold in the set cover problem, where …

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 …

Non-parametric function approximators provide a principled way to fit nonlinear statistical
models while affording formal performance guarantees. However, their complexity …

Abstract The Submodular Cover (SC) problem has attracted the attention of researchers
because of its wide variety of applications in many domains. Previous studies on this …