
An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover
In this paper, the Minimum Cost Submodular Cover problem is studied, whi...
read it

Toward Optimal Coupon Allocation in Social Networks: An Approximate Submodular Optimization Approach
CMO Council reports that 71% of internet users in the U.S. were influenc...
read it

Finding Submodularity Hidden in Symmetric Difference
A set function f on a finite set V is submodular if f(X) + f(Y) ≥ f(X ∪...
read it

Nearoptimal Approximate Discrete and Continuous Submodular Function Minimization
In this paper we provide improved running times and oracle complexities ...
read it

Submodular Maximization Beyond Nonnegativity: Guarantees, Fast Algorithms, and Applications
It is generally believed that submodular functions  and the more gener...
read it

Finding the Submodularity Hidden in Symmetric Difference
A fundamental property of convex functions in continuous space is that t...
read it

New Approximations and Hardness Results for Submodular Partitioning Problems
We consider the following class of submodular kmultiway partitioning pr...
read it
Submodular Cost Submodular Cover with an Approximate Oracle
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 given threshold. Existing approximation ratios for the greedy algorithm assume a value oracle to the benefit function. However, access to a value oracle is not a realistic assumption for many applications of this problem, where the benefit function is difficult to compute. We present two incomparable approximation ratios for this problem with an approximate value oracle and demonstrate that the ratios take on empirically relevant values through a case study with the Influence Threshold problem in online social networks.
READ FULL TEXT
Comments
There are no comments yet.