Pareto Optimization for Subset Selection with Dynamic Cost Constraints

In this paper, we consider the subset selection problem for function f with constraint bound B which changes over time. We point out that adaptive variants of greedy approaches commonly used in the area of submodular optimization are not able to maintain their approximation quality. Investigating the recently introduced POMC Pareto optimization approach, we show that this algorithm efficiently computes a φ = (αf /2)(1 − 1 e αf )-approximation, where αf is the submodularity ratio of f, for each possible constraint bound b ≤ B. Furthermore, we show that POMC is able to adapt its set of solutions quickly in the case that B increases. Our experimental investigations for the influence maximization in social networks show the advantage of POMC over generalized greedy algorithms.

Authors

• Vahid Roostapour
• Aneta Neumann The University of Adelaide
• Frank Neumann The University of Adelaide
• Tobias Friedrich Hasso Plattner Institute, Potsdam

Keywords

No keywords are indexed for this paper.